Search and sorting

Explain the basic steps of binary search algorithms. Practice with a simulation.

What will be the array status after the first round in Quick Sort: Here, $13$ is the Pivot element. $10$ points

$\backslash$table$[[15,4,9,12,15,8,19,13]]$

Question $3$: $($Show all steps$)$ Sort these numbers using Selection sort: $20,14,53,15,67,91,55,19,17$

Question $4$: $($Show all steps$)$ Sort these numbers using Insertion Sort: $260,55,65,80,603,24,3,77$

Question $5$: What is the time complexity of QuickSort when you have a good pivot? Explain how you got that.please answer all questions