Q1) Write a complete Java program that takes your first name as an input and generates an integer number (key) using the formula of summation of ASCII code for each character. Use this key to select a column number from a two-dimensional array which represents the adjacency matrix for a given graph, and to find the first edge of that graph which represents a minimum spanning tree for Prim's algorithm.