Implement in PYTHON code, E-commerce site Packet delivery agent.

Problem statement: Assume that you are in charge of an online e-commerce site which collects goods from vendors, stores them in godowns and later deliver them based on order placed. You have been assigned with robots that pick up packets from the front office and stores them in appropriate rooms. The packets are of different weights. The robot can carry 10 Kgs at a time. As in charge of the facility, you are required to give specific instructions to the robot to carry packets and store them in the rooms which are of different capacities.

The problem here is to find the correct combination of packets that can be carried by the robot so as to minimize the number of commutes by the robot to complete the job, the number of rooms used by the robot to store the contingency, and the remaining storage space.

The following figure gives the environment of the robot:

The below table gives the Packet weights and number of packets:

1. Explain the heuristic that can be used to solve the problem? Justify your choice.
2. Explain the cost function associated with your search in reaching the goal.
3. Choose the correct algorithm suitable for this grid search.
4. Implement the algorithm in PYTHON
5. Print the number of commutes by the robot, the weight carried by the robot in each commute, the number of rooms used to store the contingency and the remaining space for the store keepers reference.

5 Kg 28 Kg 20 kg G Pathway Agent's Direction 25 kg 35 kg 46 kg Agent's Direction Pathway Front Office Packet weight (Kg) No. of packets Total Weight (Kg) 1 15 15 2 5 10 4 7 28 5 2 10 6 3 18 7 2 9 4 Total 38 packets 131 Kgs 14 36 SA 5 Kg 28 Kg 20 kg G Pathway Agent's Direction 25 kg 35 kg 46 kg Agent's Direction Pathway Front Office Packet weight (Kg) No. of packets Total Weight (Kg) 1 15 15 2 5 10 4 7 28 5 2 10 6 3 18 7 2 9 4 Total 38 packets 131 Kgs 14 36 SA