Magic 11's. There are various methods to print a pascal’s triangle. But this approach will have O(n 3) time complexity. Naive Approach: In a Pascal triangle, each entry of a row is value of binomial coefficient. This works till you get to the 6th line. Print pascal’s triangle in C++. Look at the 4th line. The nth row of Pascal's triangle is: ((n-1),(0)) ((n-1),(1)) ((n-1),(2))... ((n-1), (n-1)) That is: ((n-1)!)/(0!(n-1)!) Each row represent the numbers in the powers of 11 (carrying over the digit if it is not a single number). ((n-1)!)/(1!(n-2)!) ; To iterate through rows, run a loop from 0 to num, increment 1 in each iteration.The loop structure should look like for(n=0; n