data structure

(a) A robot moves on a NxN grid, starting in the top-left comer S and moving either right or down at each step, until destination D is reached. Determine the "big O" complexity of a program that prints all possible paths from S to D. (b) Let A[1 ..n] be an array of bits (1 or 0) and F() a function of time complexity theta(n). Give the time complexity of the following C++ code fragment. Justify your result by considering different cases for A. counter = 0;for (i = 1;i