1. Here is an array which has just been partitioned by the first step of Quicksort: [3,0,2,4,5,8,7,6,9], Which of these elements could have been the pivot? (if there are more than one possibility, list them all) 2. Use the master method to give tight asymptotic bounds for the following recurrence: T(n)=T(2n)+2n