# 2 please. I don't understand how to draw them and relate to the pattern.

b) Grade is between 0 and 100. c) Some people like their steak juicy d) All amphibians like water. e) There is no storm that lasts long. 2. [10 pts] Finite State Machine a) Draw a Finite State Machine as a graph accepting binary numbers that start with the pattern 101. Test your FSM for below cases. Accepts: 1010010; Rejects: 11001, 010101, 100101 b) Draw a Finite State Machine accepting strings as a graph that contain the pattern AABB anywhere. Strings consist of only (A, B, C). Test your FSM for below cases. Accepts: CAAABBCBA; Rejects: CAABA, ABAAC, AAAC 3. [10 pts] Backtracking Below graph shows state space with cost attached to each arc. Example: The cost to travel from A to B is 100, cost from A to D is 170, i.e, [100 (A to B) + 5o (8 to C) + 20 (C to D)]. Use Backtracking algorithm to reach the goal state H. Ignore paths with cost higher than 180, Le, when traveling down an arc raises the total cost of the path to above 180 then you should not last to eiaht Show below