The number of strictly increasing functions \(f\) from the set \(\{1, 2, 3, 4, 5, 6\}\) to the set \(\{1, 2, 3, ...., 9\}\) such that \(f(i)>i\) for \(1 \le i \le 6\), is equal to:
Match the following
| List - A | List - B | ||
|---|---|---|---|
| A. | Hydrolases | I. | Argino succinase |
| B. | Lyase | II. | Fructose 1,6 bisphosphatase |
| C. | Ligase | III. | Hexokinase |
| D. | Transferase | IV. | Ribose-5-phosphoisomerase |
| V. | Glutamine synthetase |