Consider 3 sorted lists L1, L2 and L3 with 25, 37 and 30 elements respectively. In the worst case minimum number of comparisons needed to merge all 3 lists into a single list by merging 2 lists at a time is?