Problem 4. (50 POINTS) Mark clearly as TRUE or FALSE each one of the following statements. No justification required. Algorithms are the ones of the textbookotes. All input instances below consist of n keys. Any answer other than a fully written TRUE or FALSE will be considered wrong. (1) Between MergeSort and RadixSort, the former is more time-efficient in sorting n keys in the range 0,,n31. (2) Between MergeSort and RadixSort, the former is more time-efficient in sorting n keys in the range 0,,nn1. (3) Between HeapSort and RadixSort, the former is more time-efficient in sorting n keys in the range 0,,2n1. (4) The solution of T(n)=T(n/5)+T(7n/10)+n, is T(n)=(nlgn). (5) CountSort does not sort in-place