(a) What is comparison at the 2nd node on the root to leaf path? (b) What is comparison at the 3rd node on the root to leaf path? (C) What is comparison at the 4th node on the root to leaf path? (d) What is comparison at the 5th node on the root to leaf path? (e) What is comparison at the 6th node on the root to leaf path? Q6 (12 pts) This question tests your understanding of the time complexities of sorting algorithms. (a) In the decision tree for insertion sort on n elements, what is the length of the shortest root-to-leaf path? Check the corresponding box on the answer sheet. (b) In the decision tree for insertion sort on n elements, what is the length of the shortest root-to-leaf path? Check the corresponding box on the answer sheet. (e) In the decision tree for quicksort on n elements, what is the length of the shortest root- to-leaf path? Check the corresponding box on the answer sheet. (d) In the decision tree for quicksort on n elements, what is the length of the shortest root- to-leaf path? Check the corresponding box on the answer sheet. (e) In the decision tree for mergesort on n elements, what is the length of the shortest root-to-leaf path? Check the corresponding box on the answer sheet. (f) In the decision tree for mergesort on n elements, what is the length of the shortest root-to-leaf path? Check the corresponding box on the answer sheet