Some question about Haskell programming language. If anyone could help me with one of these, that would be appreciated. ================AAAAAAAA================

1/ How could one use list comprehensions in Haskell to compute how many numbers between 1 and n are divisible by $6$?

2/ What are some benefits to defining lists recursively (as either an empty list, or an element followed by a valid list)? 3/ What are some benefits to Haskell not evaluating an expression until it's needed?