1. Trace the recursive Quicksort Algorithm provided in class on the following data: 10 8 2 4 7 100 5 70 8 1 25 The trace should show all array transitions as modifications occur to the array. Minimally there should be display of the array changes as a result of each call of quicksort display of the final value returned by each call to partition 2. Write a recursive program that converts from binary to decimal. Implement and run the code and submit the .cpp file for the correct solution. All code should be in one file and there should only be 2 functions: main and binToDecimal. Hint: decimal = decimal + bit * static_cast(pow(2.0, weight)); Deliverables: Please submit your solution in Class on Thursday. For question 1 above, upload a .pdf document with the trace of the Quicksort Algorithm. You may use a scanned copy of you handwritten work done in class for this part. Upload the .cpp file with the source code for question 2 above. This must be code that executes