WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(0)
  0 :: [] -(0)-> A(5)
  0 :: [] -(0)-> A(2)
  S :: [A(2)] -(2)-> A(2)
  S :: [A(0)] -(0)-> A(0)
  S :: [A(5)] -(5)-> A(5)
  f0 :: [A(0) x A(2) x A(0) x A(5) x A(0)] -(1)-> A(0)
  f1 :: [A(0) x A(2) x A(5) x A(0) x A(0)] -(5)-> A(0)
  f2 :: [A(2) x A(0) x A(5) x A(0) x A(0)] -(4)-> A(0)
  f3 :: [A(2) x A(0) x A(5) x A(5) x A(0)] -(6)-> A(0)
  f4 :: [A(2) x A(0) x A(5) x A(5) x A(0)] -(5)-> A(0)
  f5 :: [A(2) x A(0) x A(5) x A(0) x A(0)] -(3)-> A(0)
  f6 :: [A(0) x A(2) x A(5) x A(0) x A(0)] -(2)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  S :: [A_cf(0)] -(0)-> A_cf(0)
  f0 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f1 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f2 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f3 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f4 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f5 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f6 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)