Suppose we have a lambda-term take corresponding to Haskells

take :: Int -> [a] -> [a]

and we use it in the following lambda-term ten.

ten = take 10 [0, 1, 2, ...]

Use the concepts of confluence, weak normalization, and strong normalization to explain how many normal forms the term ten has, and if it has an infinite beta-reduction