Consider a scheduling problem where there are five activities to be scheduled in

Consider a scheduling problem where there are five activities to be scheduled in four timeslots. Suppose we represent the activities by the variables A B C D and E where the domain of each variable is {1234} and the constraints are A>D D>E C A C>E C D B A BC and CD+1. [Before you start this try to find the legal schedule(s) using your own intuition.]Show how backtracking can be used to solve this problem. To do this you should draw the search tree generated to nd all answers. Indicate clearly the valid schedules. Make sure you choose a reasonable variable ordering.To indicate the search tree write it intext formwith each branch on one line. For example suppose we had variables X Y and Z with domains t f and constraints X Y and YZ. The corresponding search tree can be written as_X=t Y=t failureY=f Z=t solutionZ=f failureX=f Y=t Z=t failureZ=f solutionY=f failure(Use this book as a reference everything explained here: http://artint.info/html/ArtInt_72.html)