please answer the questions and help me do not copy please.

(b) Explain how we can detect if a graph has any cycle or not using DFS? 2. This is a multipart question. Answer the following: a. Given a weighted graph where multiple edges have the samerweight, you are asked to apply Kruskal's algorithm to find MST. You have chosen the merge sort algorithm sort the edges in descending order. "Depending on the sequence of sorted edges, yeu may have different MSTs". Is the statement True or False? Justify your answer. b. Write a pseudocode for the disjoint set data structure that prints all the elements that are present in the set where an element ' $ ' is present. You can assume that the disjoint set has N elements from 1 to N and Make-Set, Find-Set and Union operations are already implemented. c. Explain with example how disjoint set data structure would help you to perform the following operations: i. Detect number of connected components ii. Detecting cycles in the graph