Print out the values stored in the nearest and distance arrays after first iteration of Prim's algorithm. Specify the value of vnear and the next vertex that has to be added to Y

F B E Enter a valid depth-first search traversal when D is the starting vertex. Ex: A, B, C, D, E, F (commas between values)

Q6

Copying and pasting is prohibited Write a python program to implement Breadth first search Traversal

3. Implement both Prim's algorithm and Kruskal's algorithm. Compare therunning times of your programs on a set of "random" graphs.4. Write a program to find all the connected components of a graph.5. Consider the following list of integers: [1,2,3,4,5,6,7,8,9,10]. Show how this list is sorted by the following algorithms:• bubble sort• selection sort• insertion sort• shell sort (you decide on the increments)• merge sort• quick sort (you decide on the pivot value

Rewrite the MERGE procedure such that it does not use sentinels, instead stopping once either array L or R has had all of its elements copied back to A and then copying the remainder of the other array back into A.

BACKTRACKING

The contents of the array below represent a BST (Binary Search Tree). What would be the contents of the array after 30 is deleted. Briefly explain how 30 would be deleted. Use an X to represent any empty spots in the array. 30 2050 10 25 40 60

Coding in Python, we have the function to perform this task, V col_Hdeg whichinputs the adjacency matrix A of the graph and initializes the array vert_color s tohold vertex colors. It then calculates the degree of each vertex and stores it in thearray degrees.The while loop iterates until all vertices are colored and at each iteration, thevertex v with the highest degree is colored. The array temp is used to find the currentcolors of the neighbors of vertex v and an unused smallest color is determined aftersorting this array.

It's important to evaluate the merits and drawbacks of weighted graphs vs adjacency lists.