WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(1)
  activate :: [A(0)] -(1)-> A(0)
  and :: [A(0) x A(0)] -(2)-> A(0)
  plus :: [A(0) x A(1)] -(1)-> A(0)
  s :: [A(1)] -(1)-> A(1)
  s :: [A(0)] -(0)-> A(0)
  tt :: [] -(0)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  plus :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)