Write a method max$\_$score$\_$column$($self$,$ scores$)$ that takes a list scores containing a score for each column of the board, and that returns the index of the column with the maximum score. If one or more columns are tied for the maximum score, the method should apply the called AIPlayer$$s tiebreaking strategy to break the tie. Make sure that you return the index of the appropriate column, and not the column$$s score.

Notes:

One good way to implement this method is to first determine the maximum score in scores $($you can use the built$-$in max function for this$),$ and to then create a list containing the indices of all elements in scores that match this maximum score. For example, if scores consisted of the list $[50,50,50,50,50,50,50],$ the list of indices that you would build would be $[0,1,2,3,4,5,6],$ because all of these scores are tied for the maximum score. If scores consisted of the list $[50,100,100,50,50,100,50],$ you would build the list of indices $[1,2,5].$ Then once you have this list of indices, you can choose from the list based on the AIPlayer$$s tiebreaking strategy.

If you take this approach, then you don$$t really need to worry about whether there is a tie. You can always use the tiebreaking strategy when choosing from the list of indices that you construct!

We have included an import statement for the random module so that you can use the appropriate function to make a random choice for players that use the 'RANDOM' tiebreaking strategy.

Examples:

$>>>$ scores $=[0,0,50,0,50,50,0]>>>$ p$1=$ AIPlayer$(\text{'}$X$\text{'},$ 'LEFT', $1)>>>$ p$1.$max$\_$score$\_$column$($scores$)$ result: $2>>>$ p$2=$ AIPlayer$(\text{'}$X$\text{'},$ 'RIGHT', $1)>>>$ p$2.$max$\_$score$\_$column$($scores$)$ result: $5$