1. Write down the optimum path from A to Z in your opinion. Calculate the search cost of your optimum path. 2. Find the optimum path in terms of time cost.Write down both the optimum path and the total cost attached to it. 3. Find the optimum path in terms of the space cost. Write down both the optimum path and the total cost attached to it. 4. Considering the resulting paths and costs from Q2 and Q3, what is the optimum path? Justify! 12 sec 15kb F 8kb 10 sec 16kb I 11 sec 6kb 1 10 sec 16 sec -7 sec- 9kb 18kb 9kb 11 sec E A 8 sec I 9kb B 8kb -12 sec -5 sec -9 sec 11kb 12 sec L 10kb 12kb 1 11 sec 5kb Z -6 sec G 7kb 10kb 12 sec D 9 sec 21 sec I 15kb K 6kb 4 sec H 10 sec 12kb 8 sec 12kb The diagram above represents an agent space with time and space costs attached to each path. Time costs are given in seconds and space costs are given in kilobytes. Use the diagram to answer the following questions.