1. (20 points) Consider the following array which needs to be sorted in ascending order using Quicksort: [6 5 7 4 1 2 3] (a) (10 points) Explain which pairs of elements are swapped during the 1st partitioning. Also, show the content of the array at the end of the 1st partitioning. (b) (10 points) Explain which pairs of elements are swapped during the 2nd partitioning. Also, show the content of the array at the end of the 2nd partitioning. Problem 2. (20 points) Consider the following sorted array: [a b c d e f g] (a) (10 points) List the elements of the array that the binary search algorithm accesses when it searches for e. Briefly justify your answer. (b) (10 points) List the elements of the array that the binary search algorithm accesses when it searches for h. Briefly justify your answer. 1. (20 points) Consider the following array which needs to be sorted in ascending order using Quicksort: [6 5 7 4 1 2 3] (a) (10 points) Explain which pairs of elements are swapped during the 1st partitioning. Also, show the content of the array at the end of the 1st partitioning. (b) (10 points) Explain which pairs of elements are swapped during the 2nd partitioning. Also, show the content of the array at the end of the 2nd partitioning. Problem 2. (20 points) Consider the following sorted array: [a b c d e f g] (a) (10 points) List the elements of the array that the binary search algorithm accesses when it searches for e. Briefly justify your answer. (b) (10 points) List the elements of the array that the binary search algorithm accesses when it searches for h. Briefly justify your answer. 1. (20 points) Consider the following array which needs to be sorted in ascending order using Quicksort: [6 5 7 4 1 2 3] (a) (10 points) Explain which pairs of elements are swapped during the 1st partitioning. Also, show the content of the array at the end of the 1st partitioning. (b) (10 points) Explain which pairs of elements are swapped during the 2nd partitioning. Also, show the content of the array at the end of the 2nd partitioning. Problem 2. (20 points) Consider the following sorted array: [a b c d e f g] (a) (10 points) List the elements of the array that the binary search algorithm accesses when it searches for e. Briefly justify your answer. (b) (10 points) List the elements of the array that the binary search algorithm accesses when it searches for h. Briefly justify your answer.