Implement `fibSeq(n)` using a generator that yields the first `n` Fibonacci numbers starting `0, 1`, collected into an array.
+ 1 hidden test run on Submit.
The generator yields the current term then advances the pair, producing the first n Fibonacci numbers.
Run your code to see results.