EXERCISE $2$ Name Date Section $1)$ Let's experiment with datasets other than those in the examples. Start the Sorting app. $2)$ In the text area where it says Your data set goes here, remove the text and type in the following numbers. Press Enter after every number except the last. $298496694892109012881486163)$ Are these numbers sorted? Are they arranged randomly? What will the final sorted list look like? $4)$ Now let's see how our three sorting algorithms perform. Run each of the three algorithms and write down how many comparisons each required to finish the job. $($Note: You don't have to re$-$enter the numbers after each sort, because the app refreshes the numbered list on the left with the values you typed into the big text area but does not change the big text area.$)$ Selection sort Bubble sort Quicksort LA EXERCISE $3$ Name Date Section $1)$ Now for yet another dataset. Start the Sorting app. $2)$ In the text area where it says Your data set goes here, remove the text and type in the following numbers. Press Enter after every number except the last. $714204050509594948474706968523)$ Are these numbers sorted? Are they arranged randomly? What will the final sorted list look like? $4)$ Now let's see how our three sorting algorithms perform. Run each of the three algorithms and write down how many comparisons each required to finish the job. Selection sort Bubble sort Quicksort Searching for the Right Sort I $1074)$ Now let's see how our three sorting algorithms perform. Run each of the three algorithms and write down how many comparisons each required to finish the job. Selection sort Bubble sort Quicksort Searching for the Right Sort $11075)$ Which is the fastest? $6)$ Rerun the quicksort algorithm and describe what happens to the number $94.7)$ How is quicksort's behavior on this dataset different than its behavior on the previous dataset? $110$ Laboratory $10$ EXERCISE $5$ Date Name Section $1)$ Start the Searching app. Pull down the algorithm menu so that Binary search is chosen. $2)$ This exercise may be a little tedious, but there's a reason for it$,$ so bear with it$.$ For each value in the numbered list to the left, try to find it$.$ Type it into the top text area and click the search button. Then write down how many tries were required to find it$.51619253756627981991001051172003003)$ What is the greatest number of tries needed? What is the least number needed? What number of tries appears most frequently in your result list? $4)$ There are $16$ values in the list that is searched. Suppose you had $32$ values. What do you guess would be the most frequent number of searches? What if your list had $64$ values?