Exercise 3 a) Define eccentricity of the vertex and centre of a graph. Find the centre of the above graph. b) Show that with respect to the MCST by Kruska's algorithm of the above connected graph with n vertices and e edges, the tree has (n-1) branches and (e-n+ 1) chords. Exercise 3 a) Define eccentricity of the vertex and centre of a graph. Find the centre of the above graph. b) Show that with respect to the MCST by Kruska's algorithm of the above connected graph with n vertices and e edges, the tree has (n-1) branches and (e-n+ 1) chords