Problem 7 (Minimum Spanning Tree Algorithm) Write a C/C++ Program to implement Kruskal algorithm on your system to fin minimum spanning tree for the following Graph (A) and Graph (B). Please compile your answers in a file including (1) source code with comments, (2) program generated testing outputs (a minimum spanning tree), and (3) write a notes to discuss the data Structure that you present the graphs 2 2 3 6. LO 3. 4. of LO

Use A-1 to decode the cryptogram. 2 0 1 0 1 2 -9 66 27 -101 37 5 -34 61 46 -188 46 -14 9 94 21 -139 32 -4 12 66 31 -143 47 33 -162 32 19 -126 43 -9 -45 68 23 -104 A = N NH 2 -1

Given the first image of the NFA, a, b, and c

Consider the foftowing tens e A-01F3425890 and 0141507970 Assuming that the starting character is the secord duacter of A Select one 01431568920 and 03 78 4256190 b01734567920 and 03 481258690 cNone of the other alternatives. d.01234567890 and 0 12 3 4567890 e.01734568920 and 03 481257690 f.01781567920 and 03 43 4258690 9.01734258620 and 03481567990 h.01234567890 and 09 876543210 1.01734568920 and 0 8 572134690 J.01834567920 and 03471258690 k.I don't want to answer this question

What is the sequence of states that the PDA presented in problem 1 will go through when computing the string 000111? a) q0q1q1q1q1q2q2q2q2q2q3q0q1q1q1q1q2q2q2q2q2q3 b) q0q1q1q1q2q2q2q2q3q0q1q1q1q2q2q2q2q3 c) q0q1q1q1q1q2q2q2q2q3q0q1q1q1q1q2q2q2q2q3   d) q0q1q1q1q2q2q2q2q2q3q0q1q1q1q2q2q2q2q2q3   e) q0q1q1q1q2q2q2q3