Alternate Odd and Even Numbers with Two Goroutines

Write two workers that run at the same time and together produce the integers from 1 through n in increasing order. The odd worker produces only the odd numbers and the even worker produces only the even numbers, so the two workers take turns: 1 comes from the odd worker, 2 from the even worker, 3 from the odd worker, and so on.

In Go, run each worker in its own goroutine. In Java, Python, and C++, run each worker in its own thread. In JavaScript, run each worker in its own worker thread. Pass the turn from one worker to the other with synchronization, such as channels, a lock with a condition variable, or semaphores, and wait until both workers finish.

For this exercise, assume each worker adds its number to one shared output list instead of printing it, and the function returns that list after both workers finish.

The judge checks only the returned list. Building the list in one worker, or building two separate lists and merging them, returns the same list but skips the turn-taking that this question practices.