Suppose you have run k-means using k=2 and k=5. You find that the cost function J is much higher for k=5 than k=2. What can you conclude? • The ideal number of clusters is k=2. O* In the run with k=2, k-means got lucky. You should try re-running k-means with k=2 and different random initializations until it performs no better than with k=5. o« In the run with k=5, k-means got stuck in a bad local minimum. You should try re-running k-means with multiple random initializations. Od. This is mathematically impossible. There must be a bug in the code.

I need to construct a optimal binary search tree (OBST).  I am using Python to create this code. I already started creating the binary search tree. I need help trying to implement the optimal binary search tree. I did the class and then I did the insertion next to add the nodes. There needs to be at least 20 nodes. After that, I'm stuck. Not sure what code is needed to add for optimal cost.  Criteria from my assignment: Contains at minimum 20 nodes.  All paths must have a cost between 1-15. You must use each cost at least once with the remaining costs of your choice in the same range. All nodes must be able to communicate with all other nodes (does not have to be a direct path) Each node can only connect to, at maximum, 5 other nodes. The cost of an extra hop is 1 1/2 times the cost of the second path and 2 times the cost of a third path.  Any path greater than 3 is at the same cost as the third. This is what is required for us in the assignment.  My Code in Python: class BST:def…

Perform Dijkstra’s algorithm (while (Q is not empty){...}, where Q isa min priority queue) on the following graph for source node “s”, writing outevery execution of the RELAX function, the update to the priority queue and theupdates of distance from the source node and parent for the currently visited node.

C++ only. Do not copy. Correct code will upvoted else downvote.   We should call an integer cluster a1,a2,… ,a decent if ai≠i for every I.  Let F(a) be the number of sets (i,j) (1≤i<j≤n) to such an extent that ai+aj=i+j. Suppose that a cluster a1,a2,… ,an is fantastic if:  an is decent; Write a program that outputs the coordinates of elements from a array of size n×m, which is filled likesnake. Snake array - which is filled in like this: • For all j and k (j < k): aij > a(i+1)j • If i is even then, for all j and k (j < k) : aij > aik . • If i is odd then, for all j and k (j < k) : aij < aik. Here is an example of 3×4 Snake array 25 23 20 19 13 15 17 18 12 10 9 8 Input l≤ai≤r for every I;  F(a) is the most extreme conceivable among all great varieties of size n.  Given n, l and r, work out the number of superb exhibits modulo 109+7     Input        The primary line contains a solitary integer t (1≤t≤1000) — the number of experiments.        The sole line of each…