A binary erasure channel with erasure probability $p$ is a discrete memoryless channel with channel matrix

$$\left(\begin{array}{ccc} 1-p & p & 0 \\ 0 & p & 1-p \end{array}\right)$$

State Shannon's second coding theorem, and use it to compute the capacity of this channel.