Consider the pseudocode below and give an estimation of the runtime (best and worst case) in tilde notation using number of array accesses as your cost model

Input: int[]A, Array of size n

count = 0

for(int i = 0; i < n -1; i++)

int j = i + 1

while(j >= 1 && A[j] < A[j-1])

int temp = A[j]

A[j]= A[j-1]

A[j-1] = temp

j--

count++

end while

end for

return count

Show work and explain reasoning