(Solved) : Consider Following Variant Mergesort Instead Dividing Input List Two Roughly Equal Sized L Q34327022 . . . .

Consider the following variant of Mergesort. Instead of dividingthe input list into two (roughly) equal sized lists, we divide theminto three equal sized lists (assume for convenience that n = 3kfor some integer k).

Given three ordered lists A, B, C, procedure merge(A,B,C)creates a single ordered lists from these three.

3a. Show how to Merge (not mergesort) three ordered lists eachof size n/3, with a total of at most n*(5/3) compares.

The Mergesort algorithm is now

Procedure mergesort(A,n);

If n = 1 then return A.
Else divide A into three equal sized lists B, C, D.B = mergesort(B,n/3);
C = mergesort(C, n/3);
D = mergesort(D, n/3);
return merge(B,C,D);
end.

3b. Let