Consider the following block of code:

In the above code, do line 3 and line 11 have the same frequency of execution?

In the code above, 0 first

In the code above, is the frequency of execution of line 7 (n)?

In the code above, is the best-case runtime O(n)? Is it (n)?

In the code above, is the worst-case runtime (n)?

In the code above, is the runtime (n)?

i + 1 private > 2 int findSmallestIndex(T[] a, int first, int last){ 3 I smallest = a[first]; 4 int smallestIndex first; 5 for(int i=first+1; i