Data Structures Weighted Graph Applications Demonstration  Look at Figure 29.23 which illustrates a weighted graph with 6 verticies and 8 weighted edges. Simply provide: Minimal Spanning Tree as an illustration or a textual list of edges (in our standard vertex order). Single-Source Shortest Path route from vertex 0 to the other 5 (described as one path/route for each). You may draw the two solutions and attach the illustration or describe them in text (a list of edges for the one and the vertex to vertex path the other). Be sure the final trees or path lists are clearly visible in your solution.

DATA STRUCTURES AND ALGORITHMS C++ Write an algorithm which provides a path from a specific source to destination node in a graph withminimum stops. Draw a directed graph from the following adjacency list. Simulate/dry run your algorithm on it and provide step-by-step updates of values in used data structure(s) considering “A” as source and “J” asdestination.

Data Structures and Algorithms in C/C++ implement a variety of functions that operate on binary trees (the binary tree implementation from the book). You will be asked to test these functions on the following two trees (element data type is int):    implement a variety of functions that operate on binary trees (the binary tree implementation from the book). You will be asked to test these functions on the following two trees (element data type is int):  a)int count_leaves(BiTree *tree); Returns the number of leaf nodes in the tree.  b)  int count_non_leaves(BiTree *tree); Returns the number of non-leaf nodes in the tree.  c)  int get_height(BiTree *tree); Returns the height of the tree. d) void print_pre_order(BiTree *tree, void (*print)(const void *data)) Prints the elements of the tree to stdout using a pre-order traversal. The print parameter should contain the logic to print the data held in each node in the tree. e)  void print_in_order(BiTree *tree, void (*print)(const void…