Using the Random Access Model $($RAM$),$ analyse the best case time

complexity for the algorithm below. Assume each line of code takes c

time. Typically, you need to produce answers for the #times column and

the function T$($n$).$