7) For this function, determine an equation for the worst-case computing time T(n) (expressed as a function of n, i. e. 2n + 4) and the order of magnitude (expressed using big o notation, i. e. O(n)). To help you show your work, each line is numbered. Write the number of times each line executes in the appropriate blank, then list T(n) and the order of magnitude in the appropriate blanks. Use the space in which you enter T(n) to briefly explain your answer, if necessary. For example, if one or more lines are skipped in the worst case, explain which lines are skipped (or, alternatively, which lines are used to calculate T(n)). void f(double arr[], int n) { int i, j; 1 for (i = 0; i < 10; i++) { for (j = 0; j < n; j = j * 2) { if (arr[j] = i) 4 cout << arr[j]; AWN Line 1: Line 2: Line 3: Line 4: T(n) = Order of magnitude =