the foldr I use is

fun foldr f e nil = e

| foldr f e (a::b) = f a (foldr f e b);

but I don't understand how that function turning into partition

2. Revisit the previous question, but this time, you cannot define the partition from first principles (as a recursive function) nor can you use the List partition basis function. The only thing you can use is the higher-order function foldr. fun qHigh I 2. Revisit the previous question, but this time, you cannot define the partition from first principles (as a recursive function) nor can you use the List partition basis function. The only thing you can use is the higher-order function foldr. fun qHigh