Plz use Visual studio 2012 & programing language is C#

2. Graph ne Given the following graph of a LAN. Write an algorithm that will find out all computers directly connected to some given computer. The algorithm should return list of computers WK01 WK02 WK06 WK03 WKO5 WK04 Create an adjacency matrix for the above graph Write down the adjacency matrix on paper. static void Main(string[) args) stringll computers-("Wk01"," wko2", wko3", "wko4", " wkos, wk06"); // list // of computers intL] Adj; intl list; // adjacency matrix // list of directly connect computers Adj ReadMatrix2D("lan.txt" read matrix from file if (Adjnull) // if the matrix is built // Call your algorithm/function else System.Console.WriteLine"Could not read Matrix"); System.Conole.Read): // Write the function to find direct connections to a given computer 2. Graph ne Given the following graph of a LAN. Write an algorithm that will find out all computers directly connected to some given computer. The algorithm should return list of computers WK01 WK02 WK06 WK03 WKO5 WK04 Create an adjacency matrix for the above graph Write down the adjacency matrix on paper. static void Main(string[) args) stringll computers-("Wk01"," wko2", wko3", "wko4", " wkos, wk06"); // list // of computers intL] Adj; intl list; // adjacency matrix // list of directly connect computers Adj ReadMatrix2D("lan.txt" read matrix from file if (Adjnull) // if the matrix is built // Call your algorithm/function else System.Console.WriteLine"Could not read Matrix"); System.Conole.Read): // Write the function to find direct connections to a given computer