void sort$\_$by$\_$name $($College a $[],$ unsigned $n)$ ;

void sort$\_$by$\_$cost $($College a$[],$ unsigned $n)$;

void sort$\_$by$\_$living $($College a$[$l$,$ unsigned $n)$;

These functions are to sort the first $n$ elements of an array of College objects based on names $($alphabetical order$),$ cost $($descending order$),$ and the acceptance rate $($ascending order$).$ You must use three different sorting algorithms for these functions and add a comment at the beginning of the function to clarify which sorting algorithm is being used.

The focus of these functions is sorting. While you might find it helpful to add output statements in these functions to help see intermediate values of local variables, these functions shall not include any output statements when you are ready to capture screenshots of their testing. To demonstrate testing of these functions, you will need to call them along with the display function in the main function.