Exercise 6.5 Suppose we must solve planning problems for cleaning a house. Various rooms can be dusted (making the room dust-free) or swept (making the room have a clean floor), but the robot can only sweep or dust a room if it is in that room. Sweeping causes a room to become dusty (i.e., not dust-free). The robot can only dust a room if the dustcloth is clean; but dusting rooms that are extra-dusty, like the garage, cause the dustcloth to become dirty. The robot can move directly from any room to any other room.Assume there are only two rooms, the garage which, if it is dusty, is extra-dusty and the living room which is not extra-dusty. Assume the following features Lr dusty is true when the living room is dusty. Gar dusty is true when the garage is dusty. Lr dirty floor is true when the living room floor is dirty. Gar dirty floor is true when the garage floor is dirty. Dustcloth clean is true when the dust cloth is clean. Rob loc is the location of the robot, with values {garage, lr}. Suppose the robot can do one of the following actions at any time: move: move to the other room dust: dust the room the robot is in, as long as the room is dusty and the dustcloth is clean sweep: sweep the floor the robot is in. (a) Give the STRIPS representation for dust. [Hint: because STRIPS cannot represent conditional effects, you may need to use two separate actions that depend on the robots location.] Insert your set of \"Preconditions\" and \"Effects\":