WORST_CASE(?,O(n^1))

Solution:
---------

  e1 :: [A(0) x A(0) x A(0) x A(0) x A(0)] -(2)-> A(0)
  e2 :: [A(0) x A(0) x A(0) x A(0) x A(0)] -(1)-> A(0)
  e3 :: [A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0)] -(3)-> A(0)
  e4 :: [A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0) x A(0)] -(2)-> A(0)
  e5 :: [A(0) x A(0) x A(0) x A(0)] -(1)-> A(0)
  e6 :: [A(0) x A(0) x A(0)] -(0)-> A(0)
  f1 :: [] -(3)-> A(0)
  f2 :: [] -(3)-> A(0)
  g1 :: [] -(2)-> A(0)
  g2 :: [] -(2)-> A(0)
  h1 :: [] -(1)-> A(0)
  h2 :: [] -(1)-> A(0)
  i :: [] -(0)-> A(0)


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

  e1 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  e2 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  e3 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  e4 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  e5 :: [A_cf(0) x A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  e6 :: [A_cf(0) x A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  f1 :: [] -(0)-> A_cf(0)
  f2 :: [] -(0)-> A_cf(0)
  g1 :: [] -(0)-> A_cf(0)
  g2 :: [] -(0)-> A_cf(0)
  h1 :: [] -(0)-> A_cf(0)
  h2 :: [] -(0)-> A_cf(0)
  i :: [] -(0)-> A_cf(0)