?? co Inbox (1,083) 4. EEE-117-Go a Lab 4-Googl , Calle 13 . Mail-sergioz 0 Final Take Hoi 0 Files final exan X exam,part.one sprin h e file. /?/Users/Owner/AppData Local Packages/MicrosoftMicrosoftEdge Swekyb3d8bbwe Tempst You are going to demonstrate your understanding with the three sorting algorithms by showing their executions. The algorithms are: Bubble, Selection, Insertion, and Quicksort sorts. For the consistency of the evaluation, please use the only the algorithms we discussed in our lecture 1. You have the following list of numbers to sort (10 points): [54, 25, 93, 17, 77,31, 44, 55, TBD] Where TBD (to be determined) is the last 2 digits of your CSUS's Student Id You need to show all execution passes (see lecture notes on a definition of execution pass) of the algorithms, in a table row format, with the exception of Quick Sort. For example, for the first pass of execution, if we assume TBD has a value of 20, the Selection sort will have the following entry: 54 25 20 17 31 93 For Quick Sort, if TBD has a value of 20, using a recursion tree, you can use the following example to demonstrate your work 54 25 93 17 31 20 8:56 PM Type here to search 4/15/2018