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:
In the following, \( [x] \) denotes the greatest integer less than or equal to \( x \). 
Choose the correct answer from the options given below:
For x < 0:
f(x) = ex + ax
For x ≥ 0:
f(x) = b(x - 1)2
Permutation is the method or the act of arranging members of a set into an order or a sequence.
Combination is the method of forming subsets by selecting data from a larger set in a way that the selection order does not matter.