Only #1

Report the runtime of the algorithm Genesis, as defined in the provided file.

For the algorithm:

• identify precisely the lowest number of comparisons between array elements (e.g., "A[x] > max") that would happen if you arranged all the data specifically to minimize this count
• identify precisely the highest number of comparisons between array elements (e.g., "A[x] > max") that would happen if you arranged all the data specifically to maximize this count

Calculate the exact number of comparisons in terms of variable n) made between two values from the array in each of the following algorithms. Ignore other comparisons, such as determining when a loop should end. Postcondition: Displays max and min, such that V1 A[i] and min max then max + A[2] for r= 2..n do if A[x] A[i] and min mar then max - A[] else if A[2] A[i] and min A[2 + 1] then append ( H, A[2] ) append ( L, A[2 + 1]) else append (L, A[3]) append( H, A[2 +1] ) +2 mar + H1] for i = 2..n/2 do if H[i] > max then max + H[i] min + L[1] for j = 2..n/2 do if L[j]