Assume that the Sort(list L) function operates in O(nlogn) time, where n is the length of the list (of numbers.) Variables L1, L2, and L3 are lists of real numbers, all of length n. Given the following pseudocode function: Function Sort3(L1, L2, L3) K1 = Sort(L1) For each element, E1, of L1, Add E1 to each element of L2 K2 = Sort(L2) For each element, E2, of L2 Add E2 to each element of L3 K3 = Sort(L3) End-For End-For L= Append lists K3, K1, and K2 return L Consoli W Which function dominates the run time of Sort3(L1, L2, L3)? ​