Please use the C++ code to solve it with specific explaination,thank you.

(a) Write an algorithm which detects whether a directed graph is a directed acyclic graph (DAG) 4. (10 Marks) (b) Write an algorithm which sorts text words based on their alphabetical order in dictionaries. Analyze the worst case time complexity of the designed algorithm (10 Marks (c) Write an algorithm which can find a minimum spanning tree among all possible shortest path trees for a given source vertex in a connected weighted graph (5 Marks) Show transcribed image text (a) Write an algorithm which detects whether a directed graph is a directed acyclic graph (DAG) 4. (10 Marks) (b) Write an algorithm which sorts text words based on their alphabetical order in dictionaries. Analyze the worst case time complexity of the designed algorithm (10 Marks (c) Write an algorithm which can find a minimum spanning tree among all possible shortest path trees for a given source vertex in a connected weighted graph (5 Marks)

## Expert Answer

Answer to (a) Write an algorithm which detects whether a directed graph is a directed acyclic graph (DAG) 4. (10 Marks) (b) Write …