27 The Reverse-Delete algorithm for finding MST

Instead of adding edges in increasing order while avoiding cycles, consider the following Reverse-Delete algorithm:

$$\begin{array}{rl}1:& \text{while there is a cycle remaining in the graph do}\\ 2:& \text{Find a cycle and delete the most expensive edge from this cycle}\\ 3:& \text{end while}\end{array}$$