Algorithms and data structure

Given the following list of values, (23, 17, 14, 6, 13, 10, 1, 5, 7, 12), sort L using the algorithms as indicated below.Show details of operation, in each case. 1. Treesort 2. Mergesort: a) diagram, b) with array Merge algorithm. 3. Quicksort: a) diagram, b) array-based algorithm 4. Heapsort: a) diagram, b) array-based algorithm 5. One of Bubble sort, Insertion sort, and Selection sort