WORST_CASE(?,O(n^1))

Solution:
---------

  a :: [A(0)] -(1)-> A(0)
  b :: [A(0)] -(0)-> A(0)
  c :: [A(0)] -(0)-> A(0)
  d :: [A(0)] -(0)-> A(0)
  u :: [A(0)] -(1)-> A(0)
  v :: [A(0)] -(1)-> A(0)
  w :: [A(0)] -(1)-> A(0)


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)