a$)$ Consider a graph with positive weight edges. Can the shortest path between any pair of vertices contain a cycle? Note we are talking about a cycle in a single path, not if the union of multiple shortest paths may form a cycle. $($They can but this is irrelevant.$)$

b$)$ Draw the shortest path$$s tree from H and label the nodes with their distances.