Please NO SPAM answers!  

Please write the program in Python(with comments #). Problem(AlphaBeta prunning): You are to implement the minimax(max value function and min value funtion) tree to do both alpha and beta pruning according to link(https://en.wikipedia.org/wiki/Alphabeta_pruning) and print a message "alpha pruning" or "beta pruning" each time that occurs (in addition to the max of the tree). For example, the inputted tree: ((3,8,(7,(3,0,7),(8,8,2))), (4,(7,9,8),8), (((3,6,4),2,6),((9,2,9),4,7,(6,4,5) ),4,(6,4,5))) would print "alpha pruning" 3 times and "beta pruning" 3 times. 

So the user will be prompted to enter the above input and then after the program finishes the output would be the: "alpha pruning" 3 times and "beta pruning" 3 times.

A visual representation of the tree inputted above is:

It would then preform the alphabeta pruning search and output 3 times "alpha pruning" and 3 times "beta pruning".

Max Min Max 4 4 2) (6 4) (7 6