WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [A(7)] -(7)-> A(7)
  b :: [A(5)] -(5)-> A(5)
  b :: [A(6)] -(6)-> A(6)
  c :: [A(7)] -(7)-> A(7)
  d :: [A(7)] -(7)-> A(7)
  d :: [A(5)] -(5)-> A(5)
  u :: [A(5)] -(7)-> A(5)
  v :: [A(7)] -(15)-> A(5)
  w :: [A(7)] -(12)-> A(5)


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)
  d :: [A_cf(0)] -(0)-> A_cf(0)
  u :: [A_cf(0)] -(0)-> A_cf(0)
  v :: [A_cf(0)] -(0)-> A_cf(0)
  w :: [A_cf(0)] -(0)-> A_cf(0)


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