4. [10 pts] Mini maxing to Fixed Ply Depth/ C Below graph shows hypothetical state space for a three ply look ahead. Leaf nodes at the bottom ply have the heuristic evaluations attached. You are asked to propagate numeric values up the parent at various levels using the minimax strategy. Show the numeric value in place of '?' for nodes A thru J MAX MIN MAX MIN 9 5 4 6 3 5. [10 pts] Draw separate conceptual graphs to represent each of the below sentences a) Person named Tom is short. b) There are no green swans. Dage 2 of3