3. [17 marks] Given the following sorting methods: template void sort (Elem A[], int n) { for (int i=1;i0) && (Comp::lt (Aljl, Alj-1])); j--) swap (A, j, j-1); } a) What is the name of the given function sort()? (2 marks) b) Given the unsorted list: 25, 10, 5, 20 and 15. By using the given sorting methods, write down the result of each iteration of outer for loop: (10 marks) i=0 i=1 i=2 25 10 20 15 i=3 5 10 15 20 25 c) Describe a sorting method which has a smaller Big-O than sort() in detail