0 VARISHA PARVEZ Asked: May 5, 2023In: Programs/CodesWhich of the following algorithms is used to find the maximum independent set in a graph? a) Dijkstra's algorithm b) Bellman-Ford algorithm c) Floyd-Warshall algorithm d) Bron-Kerbosch algorithm0alhorithmitlanguage