Need Help with quesiton 28&29!

Open inal Revie doc x suNY New Paltz-Web E /ssignments-tall! 7-CF; x problem sets.pdf \ G Home Chegg.com x Suppose you need to sc C secure https://bbrewpaltz.slnsury d-2250689-dt-content-rid-4319842 2/courses/fall1 CPS415 01/problem sets.pdf problemsets.pdf 819 a. Suppose you need to schedule tasks on a machine, find the maximum numher of tasks that can be scheduled on a single machine, and give a set of compatible tasks that achieves this maximum task12 3 4 I0 Start b. Bonus (5 pts, I pt to exam). For the same asks list above, find the minimum number of machines required to complete all tasks, and give a schedule for doing so. 29. Minimum Spanning Tree. Find the MST of the following figure. Use Kruskal's Algorithm Use Prim's Algorithm a. b. 15 (8 5 16 4 14 12 2 3 16 6 15 30. Use Dijkstra's algorithm to find the shortest path from vertex v5 to all other vertices for the graph below. Show the solution graph. Disc solutions.pdf Show all 801 AM O Type here to search 12/5/2017 3 Open inal Revie doc x suNY New Paltz-Web E /ssignments-tall! 7-CF; x problem sets.pdf \ G Home Chegg.com x Suppose you need to sc C secure https://bbrewpaltz.slnsury d-2250689-dt-content-rid-4319842 2/courses/fall1 CPS415 01/problem sets.pdf problemsets.pdf 819 a. Suppose you need to schedule tasks on a machine, find the maximum numher of tasks that can be scheduled on a single machine, and give a set of compatible tasks that achieves this maximum task12 3 4 I0 Start b. Bonus (5 pts, I pt to exam). For the same asks list above, find the minimum number of machines required to complete all tasks, and give a schedule for doing so. 29. Minimum Spanning Tree. Find the MST of the following figure. Use Kruskal's Algorithm Use Prim's Algorithm a. b. 15 (8 5 16 4 14 12 2 3 16 6 15 30. Use Dijkstra's algorithm to find the shortest path from vertex v5 to all other vertices for the graph below. Show the solution graph. Disc solutions.pdf Show all 801 AM O Type here to search 12/5/2017 3