Use Dijkstra$$s algorithm to find the length of a shortest path between the following vertices in the weighted graph?

I. A and F

II$.$ A and D

III. B and F

whether the undirected graphs shown have Euler circuits. Construct an Euler circuit if one exists. If no Euler circuit exists, determine whether the undirected graph has an Euler path. Construct