$4\mathrm{.}30$ Prove that the block graph of a connected graph is a tree and all leaves of $B(G)$ are blocks of $G.$

$4\mathrm{.}31$ Prove Theorem $4\mathrm{.}26$: A graph $G$ is $2-$edge$-$connected if and only if it has a closed$-$ear decomposition.