Part 1: Constraint Satisfaction Problem : Problem statement: War Zone Supply Agent The following scenario depicts a city in Afghanistan. India has sent food supplies to needy people. There are 10, 2-kilogram packets of dhal, 15, 1000-ml cartons of milk, 10, 2.5-kg packets of flour, 20, 2-kg packets of rice, 15 bread loaves. Each child consumes about 2 cartons of milk and one loaf of bread in 5 days and adults consume 2.5 Kilogram flour and 2.5 kilograms of rice and 1 kilogram dhal in 5 days. The following picture shows the number of people living in tents throughout the city. Since it is a war zone, drone agents are employed to distribute supplies. You are to program a robot to distribute the supplies to different tents based on the number of people living there using a smaller number of commutes and see that all the tents are supplied. In the figure A denotes adults and C denotes children. The drone agent can carry 10 Kgs weight or 10 bread loaves or 10 cartons of milk at a time. Assume each bread loaf has 10 slices of bread. Flour can be replaced by rice. All the populated tents have to be supplied with at least a minimum quantity of food resources that will last for 2 days. Design a CSP agent for resource allocation, before distributing in the zone. a. Draw the constraint satisfaction graph to represent this problem. b. Implement Python code for the design under part a, using DFS with Backtracking and heuristics including LCV and Forward checking. c. Print the Tent-wise distribution and scheduling details.

12 A, 30 24,20 Agent path ZA Agent path 2 A,20 Food supplies 3A. 3C 3A, 1C