I believe this is doing selection sort? I also know the lowest value of count will be 0. But I am not sure how to do the other questions, any help?

Consider the pseudocode below and (a) give an estimation of the runtime (best and worst case) in tilde notation using number of array accesses as your cost model, (b) describe in one sentence what the algorithm does to the input array, (c) tell what the lowest possible value of count is at the end, and (d) tell what the highest possible value of count is at the end. For each question, show your work and/or explain your reasoning. Input: int[] A, an array of size N Output: ? count : = 0 for(int i = 0; i = 1 && A[j]