WORST_CASE(?,O(n^1))

Solution:
---------

  "0" :: [] -(0)-> "Nat"(5)
  "0" :: [] -(0)-> "Nat"(1)
  "0" :: [] -(0)-> "Nat"(9)
  "0" :: [] -(0)-> "Nat"(0)
  "cons" :: ["L"(0) x "Nat"(0)] -(0)-> "L"(0)
  "conv" :: ["Nat"(9)] -(1)-> "L"(0)
  "half" :: ["Nat"(5)] -(1)-> "Nat"(9)
  "lastbit" :: ["Nat"(1)] -(1)-> "Nat"(0)
  "nil" :: [] -(0)-> "L"(0)
  "s" :: ["Nat"(5)] -(5)-> "Nat"(5)
  "s" :: ["Nat"(1)] -(1)-> "Nat"(1)
  "s" :: ["Nat"(9)] -(9)-> "Nat"(9)
  "s" :: ["Nat"(0)] -(0)-> "Nat"(0)


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




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