Problem 3: Array Reversal We have come through an old algorithm whose name indicates that it reverses the array elements; its pseudo-code was defined as follows: note n := A.length denotes the size of...

please write the graph full code & write the complexity of its worst-case
time.

Extracted text: Problem 3: Array Reversal We have come through an old algorithm whose name indicates that it reverses the array elements; its pseudo-code was defined as follows: note n := A.length denotes the size of the array, number of items. Algorithm 2 REVERSE-ARRAY(A) s+ [), e + while s >0 A e < (n="" –="" 1)="" do="" swap="" (a[s],="" a[e])="" s="" +="" s="" –="" 1="" n-="" e="" te+1="" end="" while="" implement="" the="" algorith".="" m="" python,="" and="" test="" it="" b="" empirically,="" show="" the="" performance="" curve="" of="" the="" algorithm="" using="" time="" measurements="" c="" using="" the="" basics="" of="" the="" theoretical="" analysis,="" write="" the="" complexity="" of="" its="" worst-case="" time.="" d="" prove="" that="" the="" algorithm="" is="" actually="">