Write a (sequential) program c++ that determines all paths between any two nodes for hypercube networks of arbitrary dimension

Describe an efficient algorithm for finding a maximum spanning tree in G, which would maximize the bandwidth between two switching centers. Describe the problem in terms of input and expected output clearly. Develop a program that accepts a network G of switching centers and the bandwidth between them (not all are connected directly with each other) and two switching centers a and b; it will output the maximum bandwidth between any two switches a and b. Please give solution in Java/C/Python language

Construct the call graph for a set of seven telephonenumbers 555-0011, 555-1221, 555-1333, 555-8888,555-2222, 555-0091, and 555-1200 if there were threecalls from 555-0011 to 555-8888 and two calls from555-8888 to 555-0011, two calls from 555-2222 to555-0091, two calls from 555-1221 to each of theother numbers, and one call from 555-1333 to each of555-0011, 555-1221, and 555-1200.

Write a c++ program to demonsarte simple link list add few nodes and initial data in each not.