WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(4)
  0 :: [] -(0)-> A(0)
  half :: [A(4)] -(2)-> A(4)
  log :: [A(4)] -(0)-> A(0)
  s :: [A(4)] -(4)-> A(4)
  s :: [A(0)] -(0)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  half :: [A_cf(0)] -(0)-> A_cf(0)
  log :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)