show your work

Problem 4: The selection sort algorithm starts by finding the least element in the list. This element is moved to the first position while the element that previously occupied the position is moved where the least was. Then the least element in the remaining list is found and put in the second position. This procedure is repeated until the entire list is sorted. (a) How many comparisons are done in a list of 10 elements? Now give the formula for the number of comparisons in terms of n elements. (b) Arrange the following functions in order so that each function is big-O of the next going from left to right. (1.5)", n100, (log n)?, Vn log n, 101 () Show that x is 0(x4)