1. Make sure you could trace the following pseudocode for a given input //Sort a list of elements, a[1], a[2], ... a[n] into ascending order //input: a list a[1...n] lloutput: the list elements are rearranged into ascending order, i.e., // a[1] a[i+1] swap (a[i], a[i+1]) a) if input instance is a[1...6] = { 10, 3, 4, 8, 1,5} show the list a after the second iteration of the outmost loop (i.e., repeat for n times) b) How many times the comparsion statement (if a[i] > a[i+1]) is executed totally, for the above input instance? How many times the swap function is executed for the above input instance