Why we call the "if" function in Haskell a function? Because everything in Haskell is a function. Because it can be used inside a function definition. Because it sounds more fancy this way. Because in Haskell, the "if" function must return a value. The following is a Haskell implementation of the quicksort algorithm: quioksort[1=quicksort(x:xs)=letsmallersorted=quicksort[aax]insmallersorted++[x]++biggersorted What is used as the pivot in this algorithm? The tail The last element A random element The head In the following (partial) Haskell definition: myFuncx:xs= The parameter can be any list anything anything but a single value any list with at lease one element