Discrete structure

I need those 2 answer.

Please answer me correctly

Hand writing answer is okay. As long as it's correct.

If you are not sure , pls don't answer.

I promise to give you a thumbs up.

Take your time. No rush.

Thank you.

1. Determine whether the given graph has (1) an Euler circuit, and (2) a Hamilton circuit. If it does, find such circuit (s). If it does not, give an argument to show why no such circuit exists. 2. Apply Dijkstra's algorithm to find a shortest path (in mileage) between San Francisco and Boston in the airline system MILEAGE Chicago 855 New York San Francisco Los Angeles