**************************************ANY CODE SHOULD BE WRITTEN IN C++*********************************************

*************************************PLEASE PROVIDE EXPLANATIONS*****************************************

2oect the algoriht nhe righ: (spts) a) Selection Sort b) Insertion Sort c) Merge Sort d) Quick Sort 1) best for random unsorted arrays 2) best when fewer swaps are involved 3) best for random large arrays 4) best for nearly sorted arrays 3. Given a list {29, 10, 32,4,9, 19) what will be the list obtained after the 4th pass of selection sort? (2pts) 4. The Tower of Hanoi is a famous mathematical puzzle. In a temple in thel East, priests are attempting to move a stack of golden disks from one tall pol another. The initial stack has 64 disks stacked onto one pole and arranged fi bottom to top by decreasing size. The priests are attempting to move the stack from one pole to another w following these rules: 1) Only one disk can be moved at a time. 2) Each move consists of taking the upper disk from one of the stacks and plac it on top of another stack i.e. a disk can only be moved if it is the uppermost d on a stack. 3) No disk may be placed on top of a smaller disk. Below is the workflow of the process for 4 disks. Note: Tower of Hanoi Demonstration Write a recursive function hanoiTower to solve this problem. (4pts) 5. For the function call of hanoiTower(3, 'A', 'B,, ,)in previous question. what is the 5th step you get ? [You need to write the output from 'cout' displaying the source, destination and intermediate poles name in that step, e.g. Move top disk from pole A to pole B] (3pts) 6. How many moves you need to make to move n number of disks from A to B? (3pts) 7. Consider the following code snippet, what will be the output? (2pts) int y 9 *x*3 y +-3; cout