Describehowonecanimplementeachofthefollowingoperationsonanarray so that the time it takes does not depend on the array$$s size n$.$

a$.$ Deletetheithelementofanarray$(1<=$i$<=$n$).$

b$.$ Delete the ith element of a sorted array $($the remaining array has to stay

sorted, of course$).$