Discrete structure

No. 2. Pls.

ASAP.

Note: Please provide solution procedures for each question, including any assumptions and conditions 1. Find the transitive closure of the relation R represented by following digraph. 2. Let R be the relation represented in the above digraph in #1, and let s be the symmetric closure of R. Find SoR, and discuss what you can see from the result. 3. Below is a networking model for data centers in multiple cities. Is there an Euler circuit in the graph? Explain the reason for your answer If yes, show such a circuit, if not, can you show an Euler path in the graph? Detroit New York Chicago San Francisco Washington Denver Los Angeles 4. Apply Dijkstra's algorithm to find a shortest path (in mileage) between Miami and San Francisco in the airline system New York San Francisco 451 Los Angeles