3.3 Paths with Costs Rewrite the problem description for the program you defined in section 3.1, to include the individual cost C (an integer describing the distance in meters) between locations of the house as shown in Fig. 2. Once you have a new representation that takes individual cost between locations into account, rewrite also you search program to calculate the total cost of a path, so that when you return a path P as a solution, you also return Ctotal. Your new program should also return every path, if there is more than one, returning the cheap ones first, and then the more expensive ones, in rank order. Then use your new program to define how to meet up from two origins O1 and O2 to a destination D (as in 3.2), only if the cost Ctotal is the same from both O1 and O2 respectively. Figure 2: Cost between locations. Test your program using Fig. 1 by asking different queries and see whether your work produces the expected outcomes. [30\%]