I need help writing a C++ program implementing Kruskal Algorithm in my system to find a minimum spanning tree of Graph A and B.

In Python

solve the famous josephus problem using c++ using circular queue and by using arrays

Let xHead, yHead and zHead be the head pointers of 3 linked lists of integers (called X-list, Y-list and Z-list, respectively, from here). X-list and Y-list are each sorted (in non-decreasing order) in itself and each may be empty. Z-list is initially empty (i.e., zHead initially contains the null pointer). Develop and test a recursive C++ function called SortedMergeRecur that combines the nodes in X-list and Y-list into Z-list such that, after calling the function, Z-list is a sorted list (in non-decreasing order) containing all the nodes initially contained in X-list and Y-list  –  X-list and Y-list should both be empty after the call.   Other specifications/requirements:   ● Each node of the list has the following structure:       struct Node{   int data;   Node *link;};   ● The function should:     ► Have only three parameters (each a pointer-to-Node) and no return value (be a void function).     ► Not use any global variables or static local…