just question 3

2. 3s ptsj Represent below sentences in p b) Bella is a Labrador and a friendly dos c) Some cats are black a) All turtles are reptiles e) No integer is even 3. (10 pts] Draw a Finite State Machine (circles and ares) accepting strings that contain the pattern 101. Test your FSM for below cases. Accepts: 10010100 Rejects: 1100110 4. (10 pts] Minimaxing to Fixed Ply Depth 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