WORST_CASE(?,O(n^1))

Solution:
---------

  2nd :: [A(0)] -(3)-> A(0)
  activate :: [A(0)] -(3)-> A(0)
  cons :: [A(0) x A(0)] -(1)-> A(0)
  from :: [A(0)] -(2)-> A(0)
  n__cons :: [A(0) x A(0)] -(0)-> A(0)
  n__from :: [A(0)] -(0)-> A(0)
  s :: [A(0)] -(0)-> A(0)


Cost Free Signatures:
---------------------