WORST_CASE(?,O(n^1))

Solution:
---------

  cons :: [Nat(9) x L(9)] -(9)-> L(9)
  cons :: [Nat(0) x L(0)] -(0)-> L(0)
  cons :: [Nat(14) x L(14)] -(14)-> L(14)
  f :: [L(9)] -(1)-> L(0)
  g :: [L(0) x L(0)] -(1)-> L(0)
  h :: [L(14)] -(12)-> L(0)
  nil :: [] -(0)-> L(9)
  nil :: [] -(0)-> L(0)
  nil :: [] -(0)-> L(14)
  nil :: [] -(0)-> L(6)


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

  cons :: [Nat_cf(0) x L_cf(0)] -(0)-> L_cf(0)
  f :: [L_cf(0)] -(0)-> L_cf(0)
  g :: [L_cf(0) x L_cf(0)] -(0)-> L_cf(0)
  nil :: [] -(0)-> L_cf(0)


Base Constructors:
------------------
  cons_L :: [Nat(1) x L(1)] -(1)-> L(1)
  nil_L :: [] -(0)-> L(1)