Consider the following algorithm that updates the values in the array A$.$

$($a$)$ Compute the time complexity of this algorithm in the

best case. You must explain how you computed the time complex$-$

ity, and you must give the order of the complexity.

$($b$)$ Compute the time complexity of this algorithm in the

worst case. You must explain how you computed the time com$-$

plexity, and you must give the order of the complexity.

Data: Array A storing $n$ integer values

Result: None

ilarr$0$;

while $i=0$larr$1A[i]>0A[i]larr-A[i]larr-1$ilarri$+ido$

$ifi=0$ then

$|$ step larr$1$

end

else $ifA[i]>0$ then

$A[i]larr-A[i]$;

step larr$-1$;

end

ilarri$+$ step;

end