Prove that for matroids the independence, basis-superset, closure and rank
oracles are polynomially equivalent.
Hint: To show that the rank oracle reduces to the independence oracle, use
the BEST-IN-GREEDY. To show that the independence oracle reduces to the
basis-superset oracle, use the WORST-OUT-GREEDY.
(Hausmann and Korte [1981])