1) How many possible ways could a list of n values be ordered, i. e., how many ordering permutations are there? 2) Argue that if you know a list’s order permutation, sorting is easy (linear time), and conversely, if you know the steps to sort the list, you can easily generate the order permutation. 3) Given this, argue that sorting can’t be easier than finding the order permutation.