Estimate the worst case time complexity in terms of n for thefollowing:
low := 1
high := n
while low <= high do
if A[low+10] exits then
low := low+3
else
for k := low to n-1 do
low :=low+1
end for
high := high-2
end if
end while
Expert Answer
An answer will be send to you shortly. . . . .