Let p> 2. Consider the graph G, whose set of 2p vertices is [0..(2p-1)] and whose set of 2p + 1 edges is {0-1, 1-2,.... (p-1) p.p (p+1), (2p 2)-(2p-1), (2p-1)-0}

U {0-p} For illustration, here is how G3 looks like: 3 Count the number of distinct spanning trees of Gp. Express your answer in terms of p. Justify your answer.