Data Structures: part 2 is what I'm confused on. please explain each step. thanks!

2. (i) Compare the e complexities of insertions to and deletions from a priority queue imple- ente as an unsorted array, sorted array, unsorted linked list, and sorted linked list. (You have to just provide the bis-0 estimates of the alcorithms. You do not have to write the algorithms) etermine the time complexity of the following function: (assume n 2m for integer int stupid.add(int A[ ], int n) { int sum=0; if (-1) return A[0]; sum+=stupid.add(A,n/2); sum+=stupid.add((A+n/2),n/2); return sum