Using the functor from Exercise 25, define the necessary
instances and write a non-recursive emptyLength :: Empty -> Integer function that operates on
the original non-fixedpoint tree using cata from recursion-schemes
Using the functor from Exercise 25, define the necessary
instances and write a non-recursive emptyLength :: Empty -> Integer function that operates on
the original non-fixedpoint tree using cata from recursion-schemes