HW4CS425Fall2017 (2) (Protected View) -Word References Mailings Review View Help Tell me what you want to do et can contain viruses. Unless you need to edit, it's safer to stay in Protected View. Enable Editing 3. Illustrate Kruskal's algorithm to find the minimum spanning tree for the graph below: 15 4. Given n 7, k : 4 Find out all Binomial coefficients C(n, k) using Dynamic Programming. 5. Given two DNA strings as X-(TAACGC) and Y = {ATCAGAC) Determine the longest common subsequence using Dynamic Programming algorithm Describe the algorithm properly