Given two sorted lists of size m and n respectively.The number of comparisons needed in the worst case by the merge sort algorithm will be?

• [A] Stack
• [B] Set
• [C] List
• [D] Queue

• [A] 2,2,1,1,2
• [B] 2,2,1,2,2
• [C] 2,1,2,2,1
• [D] 2,1,2,2,2

• [A] Dynamic programming
• [B] Backtracking
• [C] Divide and conquer
• [D] Greedy method

• [A] 3
• [B] 9
• [C] 7
• [D] 5

• [A] Divide and conquer strategy
• [B] Backtracking approach
• [C] Heuristic search
• [D] Greedy approach