2 Matching Card Pairs Problem Matching Card Pairs is a fun and puzzle game. You can try to match pairs by flipping cards in as little moves as possible in order to finding matching pairs in two sets. Complete the state space of the following state: 3 PEAS For each of the following activities, give a PEAS description of the task. - Playing soccer - Shopping for used Al books on the Internet - Playing a tennis match - Performing a high jump - Knitting a sweater - Math tutor - Intelligent Ship - Tie-tac-toe game 3.1 Properties of Task Environments For each of the following activities, give properties of task environments. 1 The wolf-goat-cabbage Problem Description of the problem: There is a farmer who wishes to cross a river but he is not alone. He also has a goat, a wolf, and a cabbage along with him. There is only ene boat available which can support the farmer and either of the goat, wolf or the cabbage. So at a time, the boat can have only two objects (farmer and one other). Figura 1: The wolf-goat-cabbage problem But the problem is, if the goat and wolf are left alone (either in the boat or onshore), the wolf will eat the goat. Similarly, if the goat and cabbage are left abone, then goat will eat the cabbage. The farmer wants to cross the river with all three of his belongings: goat, wolf, and cabbage. Complete the state space of this problem. The green state is valid state (you should expand it until to reach the goal state) and orange state is invalid state (you should not expand it). - w: wolf - g: goat - e: cabbage - f: framer - Il: river In the following graphs, assume that if there is ever a choice amongst multiple nodes, both the Breadth-first search (BFS) and Depth-first search (DFS) algorithms will choose the left-most node first. Starting from the green node at the top. Show the path of the travel in this graph by DFS and BFS algorithms and then which of theses algorithms will visit the least number of nodes before visiting the yellow goal node? 5 Uniform-cost Search Suppose you have the following directed graph. If you were to perform a Uniform-cost search, starting at a and trying to reach g. What are the path and the path cost? Show your answer in detail