(10%) Consider the following Java code segment, where N is a positive integer and is assumed to be some power of 2. Determine the total number of lines that will be printed from this nested for loop. Show your work to receive full credit. 7, for (int i-l: 1CN: 1++) j"1 ; ja: j-j+2) { (int System.out.printin(*j) for 8. (10%) Consider the following recursive algorithm, where n,-1, is the input Algorithm T(n) f if (n -1) return 1; else return T(n-1) +2*n -1 Set up a recurrence equation and initial condition for the number of multiplications M(n) made by this algorithm. a) b) Determine the explicit solution for M(n) (10%) show the results of the first four passes (four iterations of the outer for loop) of the algorithm Bubble Sort discussed in class for the following list of integers 9, 50 403 35 Pass 1 Pass 2 Pass 3 Pass 4