(6) 120 pts.] Answer questions (a) and (b) below: (a) How many times exactly is the code block below executed? For (1-1, n) For (j-1, i) For (k-1,j) code block Hint: You have to start with n-1, then make assumption what you make expect for any given n- N, and check if the formula you found works for n N+1 This is what we call prove by induction. (b) What is the theta value of this code segment