You are given t sorted lists A₁, A₂, . . . , A_t each of size n. First, show that the following algorithm runs in O(t²n) time. Note the Merge procedure above is the one we used

Initialize C to be an empty list.
for i = 1, 2, . . . , t do
C = Merge(C, A_i).
end
Return C.