WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "A"(2)
  "0" :: [] -(0)-> "A"(0)
  "activate" :: ["A"(2)] -(1)-> "A"(0)
  "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "f" :: ["A"(2)] -(1)-> "A"(0)
  "n__f" :: ["A"(2)] -(2)-> "A"(2)
  "n__f" :: ["A"(0)] -(0)-> "A"(0)
  "p" :: ["A"(0)] -(1)-> "A"(2)
  "s" :: ["A"(2)] -(2)-> "A"(2)
  "s" :: ["A"(0)] -(0)-> "A"(0)


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




Base Constructors:
------------------