WORST_CASE(?,O(n^1))

Solution:
---------

  0 :: [] -(0)-> A(3)
  activate :: [A(0)] -(2)-> A(0)
  cons :: [A(0) x A(0)] -(0)-> A(0)
  from :: [A(0)] -(1)-> A(0)
  n__from :: [A(0)] -(0)-> A(0)
  s :: [A(3)] -(3)-> A(3)
  s :: [A(0)] -(0)-> A(0)
  sel :: [A(3) x A(0)] -(1)-> A(0)


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

  0 :: [] -(0)-> A_cf(0)
  activate :: [A_cf(0)] -(0)-> A_cf(0)
  cons :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)
  from :: [A_cf(0)] -(0)-> A_cf(0)
  n__from :: [A_cf(0)] -(0)-> A_cf(0)
  s :: [A_cf(0)] -(0)-> A_cf(0)
  sel :: [A_cf(0) x A_cf(0)] -(0)-> A_cf(0)