Can you do all steps in one code with c language please?

1. Construct a 11-node directed graph in any programming language. 2. Implement a Cycle Detection Algorithm to find all cycles in graph. 3. Implement BFS algorithm. (it can be study for all vertices as a start vertex.) 4. Find the number of strongly components. Then think of that same graph as an undirected and give the weights what you want: 5. Implement Kruskall algorithm. (it can be study for all vertices as a start vertex.)