3. Sorting. Implement a generic Stack linked list data structure for integers that supports these iin: a. i InsertionSort(), which runs an insertion sort algorithm on the stack Your insertionSort() algorithm should print to the console every time it makes a swap. Print the operation performed ("Swapped a with b") then on the next line print the current contents of the array. Print to the console when the sort has finished("Sort finished!") 1. ii. iii. iv. 2. Push(int data), which pushes values to the head of the stack Pop():, which pops values from the head of the stack and returns it Peek(), which returns a value from the head of the stack