WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [A(0)] -(4)-> A(4)
  b :: [A(0)] -(8)-> A(4)
  c :: [A(0)] -(12)-> A(4)
  d :: [A(14)] -(15)-> A(0)
  e :: [A(1)] -(1)-> A(1)
  e :: [A(0)] -(0)-> A(0)
  u :: [A(14)] -(0)-> A(14)
  u :: [A(0)] -(0)-> A(0)
  v :: [A(1)] -(12)-> A(0)


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




Base Constructors:
------------------
  a_A :: [A(0)] -(1)-> A(1)
  e_A :: [A(1)] -(1)-> A(1)
  u_A :: [A(1)] -(0)-> A(1)