Implement `takeEvens(n)` that pulls the first `n` even numbers from an infinite generator (`0, 2, 4, ...`), returning them as an array.
+ 1 hidden test run on Submit.
An unbounded generator paired with a bounded take loop yields the first n even numbers without hanging.
Run your code to see results.