completing this by hand would be helpful

Games 2. Mario and Bowser decide to play a game to find the princess. Mario wants to find the Princess in the shortest amount of time (MAX the time left) while Bowser wants Mario to take the longest amount of time (MIN the time left). Mario starts with 300 seconds to find the princess. Bowser will win if Mario runs out of time ( 0 seconds or less) and Mario will win if there is any time left on the clock ( 1 second or more). Bowser makes the first move from the start position and chooses square nodes. Mario will choose second and choose circle nodes. They can only move in the direction of the arrows. The number along the path indicates how many seconds it takes to move along that path. Remember the game starts with 300 seconds total 1. Convert the map into a tree. 2. Perform the minimax algorithm on your game tree 3. How many seconds are left at the end of the game