1. Suppose, you are given a 5x5 chessboard and 5 queens: Q1,Q2,Q3,Q4,Qs. It is assumed that every Qi is placed on any row and the ith column only, i.e., Q2 is placed only on the 2nd Column, Q5 is placed only on the 5th Column and so on. You'll have to figure out such arrangements of these 5 queens on the given chessboard, where the queens don't attack each other. Two queens will attack each other if they stay - on the same row - on the same column - diagonally (both upwards and downwards) Now, solve the given N-Queen problem ( N=5 ) for this particular case/scenario only when Ql is placed on the 3rd row (Ql,R3). Generate and depict the State Space Tree for the given case (Ql,R3) only. Remember! It's assumed by default that two queens will never sit on the same row and on the same column. These trivial cases won't be displayed on your State Space Tree. So, generate such a State Space Tree that will be free from all such trivialities. The only Bounding Function/Violation you'll be able to illustrate on the Solution Tree to KILL a node is when two queens sit diagonally. 2. Consider the following DAG that portrays daily elothing for any human at the time of getting dressed, where each node/vertex stands for one of the daily-life garments and each directed edge (u,v) means that garment u must be put on before garment v. Now, show the ordering of vertices produced by the Topological Sort algorithm when it is run on the given DAG : Figure: Daily Clothing DAG