WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(7)
  0 :: [] -(0)-> A(11)
  0 :: [] -(0)-> A(13)
  bits :: [A(11)] -(5)-> A(0)
  half :: [A(7)] -(1)-> A(11)
  s :: [A(7)] -(7)-> A(7)
  s :: [A(11)] -(11)-> A(11)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(8)] -(8)-> A(8)


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

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


Base Constructors:
------------------
  0_A :: [] -(0)-> A(1)
  s_A :: [A(1)] -(1)-> A(1)