Defining and Clarifying the Verification Process for NMT Proofs Generated from Non-Lexicographically Ordered Trees

# Problem
The issue at hand pertains to the generation of NMTs from sets of leaves that are not ordered lexicographically based on their namespaces. The behavior of NMT proofs generated from such malformed trees is unclear and needs to be addressed. The main objectives of this issue are to:

- Determine whether the current NMT proof verification system is able to detect out-of-order leaves and respond accordingly.
- If the current system is not capable, then develop and implement measures to invalidate NMT proofs generated from malformed NMTs.