Fill the blanks based on the graph shown below where the nodes are locations that a robot can reach and occupy, and the edges connecting the nodes show the direction the robot can travel from one location to another and the cost it pays doing that. (r123 (storage 0125 + 0123 o119) 16 Olli mail (13+ 8 C0103 0109 The cost for the optimal path from b3 (start node) to c3 (goal node) is [Select) If the goal node is b4, an admissible heuristic is h(o 103) = (Select]