WORST_CASE(?,O(n^1))

Solution:
---------

  ackin :: [A(0) x A(2)] -(0)-> A(2)
  ackout :: [A(2)] -(2)-> A(2)
  s :: [A(0)] -(0)-> A(0)
  s :: [A(2)] -(2)-> A(2)
  u21 :: [A(2) x A(0)] -(1)-> A(2)
  u22 :: [A(2)] -(2)-> A(2)


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

  ackin :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  ackout :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  u21 :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  u22 :: [A_cf(0)] -(0)-> A_cf(0)