Please explain your answer for each step! Thank you!

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-O 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 arr[]) int n = arr. length; for (int i 0; i