I see you've uploaded an image containing mathematical and algorithmic questions. Let me transcribe the questions and address them in detail. Here's the transcription of the questions first:

Q1.

Given a set of numbers in the following sequence: k, m, g, c, b, and a.
Demonstrate their insertions in AVL Tree.

Q2.

Given a set of numbers in the following sequence: a, k, z, b, d, and e.
Demonstrate their insertions in B-Tree (m=3).

Q3.

Based on the following weighted graph, explain the step-by-step process on how to calculate Minimum Spanning Tree (MST) using Kruskal's Algorithm.

[Graph image included in the question with labeled vertices and weighted edges.]

Q4.

Given the following link adjacency matrix for a digraph, create:

1. Its original graph, and
2. Its link adjacency list undirected graph representation.

Q5.

Start with an empty AVL Tree and insert the following sequence of keys:
12, 4, 2, 10, 8, 6
Draw the resulting diagrams to illustrate the rotations used to maintain the tree's balance.

Q6.

Given the following digraph and $G = (V, E)$:
[Image of digraph with vertices and directed edges provided.]

1. Provide any path to show a cycle.
2. Calculate degree-in at node 2.
3. Calculate degree-out at node 4.
4. Calculate $d^+(4)$.
5. Calculate $d^-(1)$.

Q7.

Given the following link adjacency list for a digraph, create:

1. Its original digraph, and
2. Its link adjacency matrix undirected graph representation.

Would you like me to work through each question step by step? Let me know where you'd like to begin! I can solve all the questions in detail or target a specific one you're focused on.