HASKELL QUESTION

type Bag a = [a]

sumB :: Eq a => Bag a -> Bag a -> Bag a -- add counts

diffB :: Eq a => Bag a -> Bag a -> Bag a -- diff b1 b2 subtracts counts of b2 from b1 (but not below 0)

unionB :: Eq a => Bag a -> Bag a -> Bag a -- take max of counts

intersectB :: Eq a => Bag a -> Bag a -> Bag a -- take min of counts

Assuming this representation, write definitions for each bag operation. Do NOT use explicit recursion.