Section B Use the answer booklet provided for your answers. 1. Define an agent. 2 Marks 2. Define rational agent. 2 Marks 3. What are the factors that a rational agent should depend on at any given time! 4 Marks 4. Define an Ideal rational agent. 2 Marks 5. List the various type of agent program, 4 Marks 6. Given the following state graph (state space) E $ C where the node, S is the initial state and the node, G is the goal (final) state, i. derive or draw the equivalent state (search) tree. ii. using the Breadth First Search, give a sequence of all the nodes (vertices) visited, ili, using the Depth First Search, give a sequence of all the nodes (vertices) visited, iv, using the Breadth First Search, find the shortest path from StoG. (10 Marks) 10 7. The Towers of Hanoi problem with three disks. The initial and the goal (final) states are as shown below. A B B Initial state Final State The following operator has been defined: Trans Disk(disk_name, from peg#,to_peg) where disk_name is the name of disk (A, B or C). from_peg# is the peg # (1.2 or 3) from which a disk is moved and to pegit is the peg # (1, 2 or 3) to which a disk is moved. As example, Trans_Disk(A,1,2)-> Disk A is moved from peg I to peg 2. Give a sequence of the use of the operator to solve the Towers of Hanoi problem with three disks. 10 Marks NOTE THAT: 1. At no time should a larger disk be on a smaller disk 2. The number steps or the use of the operator MUST BE MORE THAN EIGHT (8). 8. Show that pe is the same as (p+)*(). (4 marks) 9. Show that (-p) is the same as ((-2--9-). (4 marks) 11 10. For the following state tree (6 marks) D G give a sequence of all the nodes (vertices) visited a. using Breadth First Search b, using Depth First Search 12