Haskell/Understanding monads/Solutions/List

Bunny invasion
1. Each element gives rise to three copies of itself. The order of the copies matches the order of the original elements.

2.

List comprehensions
1.

for lists takes a list of functions and a list of values that can be passed to the functions. It then applies each function to all of the values, and gives back all results thus generated in a single list.

2. Note that the order of the generators matters when writing the list comprehension above. To see the difference, try both and  in GHCi.