3. The lower bound for any comparison sorting is W(nlogn). Why? (20%)