To find the Minimum Cost Spanning Tree (MST) using Kruskal's Algorithm, the following steps are typically involved:

1. Sort all edges of the graph in increasing order of their weights (costs).
2. Pick the smallest edge. If it doesn't form a cycle with the spanning tree formed so far, include it in the MST. Otherwise, discard it.
3. Repeat step 2 until you have $V - 1$ edges (where $V$ is the number of vertices in the graph).

Since the graph is not provided visually, please upload an image or provide the graph's description (vertices and edges with their respective weights), and I will proceed with the solution.