The minimum possible time complexity for a comparison based sorting algorithm and a random input array is o(n) :
1) true
2) false