For two positive integers a and b define the function h(a,b) as the greatest common factor (G.C.F) of a, b. Let A be a set of n positive integers. G(A), the G.C.F of the elements of set A is computed by repeatedly using the function h. The minimum number of times h is required to be used to compute G is
- $\frac{1}{2} \: n$
- $(n-1)$
- $n$
- None of these