Let p 2. Consider the graph Gp whose set of 2p vertices is [0..(2p 1)] and whose set of 2p + 1 edges is {01, 12, . . . , (p1)p, p(p+1), . . . , (2p2)(2p1), (2p1)0} {0p). Count the number of distinct spanning trees of Gp. Express your answer in terms of p. Justify your