WORST_CASE(?,O(n^1))

Solution:
---------

  "2nd" :: ["A"(8)] -(4)-> "A"(0)
  "activate" :: ["A"(0)] -(4)-> "A"(0)
  "cons" :: ["A"(0) x "A"(0)] -(0)-> "A"(0)
  "cons" :: ["A"(8) x "A"(8)] -(8)-> "A"(8)
  "cons1" :: ["A"(0) x "A"(0)] -(0)-> "A"(8)
  "cons1" :: ["A"(0) x "A"(0)] -(0)-> "A"(14)
  "from" :: ["A"(0)] -(3)-> "A"(0)
  "n__from" :: ["A"(0)] -(0)-> "A"(0)
  "n__from" :: ["A"(0)] -(0)-> "A"(10)
  "n__from" :: ["A"(0)] -(0)-> "A"(14)
  "s" :: ["A"(0)] -(0)-> "A"(4)


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




Base Constructors:
------------------
  "\"cons\"_A" :: ["A"(1) x "A"(1)] -(1)-> "A"(1)
  "\"cons1\"_A" :: ["A"(0) x "A"(0)] -(0)-> "A"(1)
  "\"n__from\"_A" :: ["A"(0)] -(0)-> "A"(1)
  "\"s\"_A" :: ["A"(0)] -(0)-> "A"(1)