I'm a bit lost on how to figure out the Big O equations for these problems.

3. (26 pts) Determine the worst-case execution time of each of the following methods as a function of the length of the input array(s). Express each of your answers as big-0 of a simple function (which should be the simplest and slowest- growing function you can identify). For convenience, your analysis of each part has been broken down into multiple steps. For each step, you just need to fill in the blank a big-O function as the answer (in the worst case always) a) (6 pts) void static methodA(int arrl]) intn-arr.length; for (int i = 0; i n-1; i++) for (int j 0; j j++) n-i-1; arr[j+1]) arr[j]; = if (arr[j]> int temp arr[j] arr[j+1] arr[j+1]; temp; i) Number of iterations of the outer for loop ii) Number of iterations of the inner for loop ii) Time for each iteration of the inner for loop iv) Worst-case execution time