1. Tarjan's LCA algorithm (see CLRS Ch21 Problem-3).
Solutions should be available on the net. Analyse the complexity with
respect to the Disjoint-Set implementations done in class.

2. JE5-20 (Describe and analyze an algorithm to solve arbitrary
acute-angle mazes.)