Which move should the first player make, based on the result of the Minimax algorithm, and why?

Select one or more:

Move to B$.$ The minimax value for A is $-9,$ corresponding to node J$,$ which can be reached via B$.$

Move to B$.$ The minimax value for A is $0,$ corresponding to node K$,$ which can be reached via B$.$

Move to B$.$ The max value that A could possibly be is $5,$ corresponding to node M$,$ which can be reached via B$.$

Move to C$.$ The minimax value for A is $-16,$ corresponding to node P$,$ which can be reached via C$.$

Move to C$.$ The minimax value for A is $-20,$ corresponding to node O$,$ which can be reached via C$.$