asap please!!

Suppose you use insertion sort to sort an array containing n distinct numbers, shuffled so that each possible order is equally likely. Which of the following is the lowest valid upper bound for the probability that more than n2/2 swaps are required? 1/4 1/2 2/3 3/4 1 1 point Consider the die-rolling game in problem 3 at the end of Chapter 2 of the notes. Suppose that you stake $216 and decide on N=3 die rolls. What is your expected amount won