WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [A(12)] -(2)-> A(0)
  b :: [A(0)] -(12)-> A(12)
  b :: [A(0)] -(2)-> A(2)
  c :: [A(0)] -(0)-> A(14)


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

  a :: [A_cf(0)] -(0)-> A_cf(0)
  b :: [A_cf(0)] -(0)-> A_cf(0)
  c :: [A_cf(0)] -(0)-> A_cf(0)


Base Constructors:
------------------
  b_A :: [A(0)] -(1)-> A(1)
  c_A :: [A(0)] -(0)-> A(1)