Which of the following best describes how the final path is determined once the goal state is reached in the A* search algorithm? a. Begin with the starting node and trace the order that nodes were added to the Open List until the goal node is reached.
b. Start at the goal node and iterate through each node’s parent until the starting node is reached.
c. As nodes as added to the Closed List, track the order until the goal node is added.

Jason typically uses the internet to buy various items. it the total cost of all of the items ordered, at one time, is $250 or more, then the shipping and handling is free, otherwise the shipping and handling is $15 per item. design an algorithm that prompts jason to enter the number of items ordered and the price of each item. (remember cost = number of items order times price) the algorithm then outputs the total billing amount including shipping and handling. your algorithm must use a loop (repetition structure) to get the number and price of each item. write this in algorithm format not program code format.