[15 pts) (a) (5 pts) Provide a simple example on an array of size 4 to show that selection sort (in its usual implementation) is not generally stable. (Refer to the detailed pseudocode for selection sort on page 99 as necessary.) Show all intermediate arrays in the implementation of selection sort. (b) (10 pts) Show that insertion sort (in its usual implementation) is stable. (Refer to the detailed pseudocode for insertion sort on page 134 as necessary.)