I need answers for exercise 6.4-6.7 Please!

Exercise 6.1. Timing the sorts Record the running times in the table, except for the boxes that are shaded. 164 1024 2048 4096 12.03 Sorts 16 Selection 0.12 Bubble 0.12 Insertion 0.09 Quick 0.02 Heap 10.07 Merge 0.04 | 128 8.17 8.15 4.03 0.55 10.90 0.70 Number of Points | 256 512 32.77 131.40 32.75 131.27 17.36 168.27 (1.43 3.05 12.06 4.62 1.66 3 .83 034 0.39 0.30 6.59 [10.28 8.70 22.59 19.42 Exercise 6.2. Comparing the sorts Compare the performance of Selection Sort, Bubble Sort, and Quick Sort. Which is the most efficient? Why? For a few items (