Q3. (25 pts) Find the minimum spanning tree using Kruska's algorithm for the following graph. For this question, the solution must be provided step by step as shown in your textbook in Figures 9.59 in page 418. he gener eft and rig t way to d vantage th g step wo ce, since nd initializ it is thai ve do not qual to t l of 2 5/16 2018, 10:55 PM 7 A. 2Retur 3 Order the 5 template et 6 const Compa ara int center if( af cen 12 f al rig Q4. (15 pts) Apply Depth First Search (DFS) algorithm to the following graph. For this question, the solution must be provided step by step as shown in your textbook in Figures 9.65 in page 424. if al right 17 18 std: :swapf al cent 19 return al rah Figure 716 Code to