Question 11 [10 marks] Recall that in Merge Sort, we divide a list L of size n into two lists L1 and L2 of size n/2, we sort L and L2 recursively, and then merge the sorted L and L2. Consider a variant of MergeSort, called MergeSort Var, where we divide a list L of size n = 3k, for some non-negative integer k, into three lists L1, L2, and L3 of size n/3, we sort L1, L2, and L3 resursively (using Merge Sort Var), and then merge the sorted L1, L2, and L3. Assume the merge operation (of L1, L2, and L3) can be done by using n comparison operations. What is the time complexity of Merge Sort Var