QUESTION 2 Let us assume a delivery shop needs to deliver products from its source location a to all other destinations. The routes from source location to other destinations and the path costs are shown in Figure 1. 8 3 d Figure 1: Graph a) Compute the shortest paths from source a to all other destinations. Show step by step procedure. (4 marks) b) Completeness and optimality are two important indicators of the performance of Breadth First Search and Depth First Search algorithm - justify the statement. (4 marks)