Can someone help me with this Exception question >>>ITS URGENT PLZZZ!!!

CSC 162 lecture 18: Big-O Worksheet 2 1. using big-o notation, describe the order of magnitude for each of the following segments of code. Rules Always go with the WORST if or else case. If a loop increases or decreases by a constant MULTIPLICATIVE factor for each iteration, then it is oolog2 no, i e., the update part of the for loop has a or If a loop increases or decreases by a CONSTANT AMOUNT for each iteration then its growth rate is o(n) i.e., the update part of the for loop has a or a. for(int i 1: i n: i++) b, if(happy Dog) nPartialSum i i print( bow-wow"): else if(happyCat) for (int i 1: i n: i++) for int i 1; ik 35 i++) for (int j 1 j n: j print("meow") nPartialSum +z i j; c. public int bruteForcesearch(int k, int[ array) d. for (int i 1; i n: i 37) total for (int i 0: i array length: it return i: //found it! return -1; //didn't find in array e, for (float x 27.2; x n; x log(1.3)) f. for (int i 1: i n: i for (int j 1. J n j 2) total++; total