Give me the python code

Part $2$: Games with Magic $[5$ Points$]$

In a strategic game simulation, Pacman and a ghost engage in a sequence of moves across three levels of

depth. The competition starts with Pacman aiming to reach a power pellet by making the first move. The

ghost then attempts to thwart Pacman's progress at the second level, followed by Pacman's final moves

to reach the pellet at the leaf nodes, where the outcomes are scored as $3,6,2,3,7,1,2,0.$ An added

strategic element is Pacman's ability to wield dark magic, allowing him to control the ghost's move at a

specific cost, c$.$ This cost is deducted from his score, influencing his overall strategy to reach the pellet.

You are tasked with developing the function pacman$\_$game$($int c$)$ to determine the most effective

strategy for Pacman, considering whether the use of dark magic, given its cost, is beneficial.

In sample output $1,$ the left subtree has the highest value $6$ and the right subtree has the highest value $7.$

If Pac$-$Man moves to the left and uses dark magic the result will be $6-2=4,$ If Pac$-$Man moves to the

right and uses dark magic the result will be $7-2=5.$