answer me quickly please

Write down a sequence (we denote this sequence by S) consisting of letters of your Firstname 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: 1. Vertex set V(G) of the graph G is a set of all pair-wise distinct letters from S. I]. Edge set E(G) of the graph G is dened as follows: two distinct vertices from V(G) are atliacent 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: 1. Construct adjacency matrix of G. 2. Construct incidence matrix of G. 3. Construct distance matrix of G. 4: Using the distance matrix, nd metric characteristics of the graph: vertex eccentricities, radius and diameter of G, center of G. 5- Find in G all its isthmases and cutpoints (cutpoint is a vertex which removal increases the number of connected components)