Algorithms, Data Structures and Computability

plz quickly

The highway distance and risk factor conditions over the highways between 7 cities named (A G) are given as follows: F. 5 (safe) A 2 (safe) 6 (very risky) 10 (safe) 3 (risky) G 2 (safe) B 50 (safe) 10 (risky) 2 (risky) 4 (very risky) C 1 (safe) 26 (safe) D 15 (safe) E a) Does this graph possess an udarnath a) Does this graph possess an Euler path or Euler circuit? Why? (4 marks) b) List the right sequence of nodes traversed by the BFS and DFS if it started from node A. (4 marks) c) without any consideration to the risk factor, find and draw the minimum-spanning tree of this graph, then calculate the total cost of this tree. (6 marks) Note: You can draw the graph on a paper then upload it. d) Use the Dijkstra's algorithm to determine the shortest least risk paths from city (A) to all other cities. Your solution must consider the risk factor (by which we multiply the actual distance) to be for safe condition, 3 for risky condition and for a very risky condition. Accordingly, determine the shortest path and cost from node A to node D. (8 marks) e) Regarding the figure with the three nodes (A, B, and c), determine the shortest paths between all pairs of nodes in the following graph using Floyd-Warshall algorithm. (8 Marks) between all pairs of nod Marks) B 4 4 C 3 A 5