Write down a sequence (we denote this sequence by S) consisting of letters of your First-name and Family-name (without a blank). With a help of this sequence S construct (draw) a simple graph G = (V(G), E(G)) (undirected graph without loops and multiple edges) using the following algorithm: I. Vertex set V(G) of the graph G is a set of all pair-wise distinct letters from S. II. Edge set E(G) of the graph G is defined as follows: two distinct vertices from V(G) are adjacent in G if and only if the letters corresponding to them are consecutive letters from S. Solve the following problems related to the obtained graph G: a) Construct adjacency matrix, incidence matrix and distance matrix of G. Find metric characteristics of the graph: vertex eccentricities, radius and diameter of G, center of G. Find in G all its isthmuses and cutpoints. b) Take some spanning tree (we denote this tree by T ) of the graph G (for this purpose remove some edges from G ). For this tree T redenote arbitrarily its vertices by numbers 1, 2, 3, Draw the tree T with numbered vertices. Find center of the tree T, construct its Prfer code. Take any central vertex of the tree T as a root and construct array of parents for T with respect to the root. Find height of the tree T under the choice of this root. First name: Etornam Last name: Akpagloh