Consider a single linked list there are n list containing m elements below are the following operations
i)Merging of two sorted lists has time complexity of O(m log n) whereas Merging of two unsorted lists has time complexity of
O(m + n).
ii)intersection of two sorted lists has time complexity of O(mn) whereas intersection of two unsorted lists has time complexity of O(mn).
iii) concatenation of two sorted lists has time complexity of O(m) whereas concatenation of two unsorted lists has time complexity of O(m).
which of the following is true?
a)only i
b)only i and ii
c)only i and iii
d)i,ii,iii
