Fixes #42
Features for verkle state root proofs and verification:

• wrapper functions for basic state root proofs
• wrapper functions for replicating the same trie in rust and inserting key values
• out of these operations
• inserting sparse key-values
• standard key-val insertion
• inserting two different leaves under the same stem
• inserting two different leaves under the 2 different stems
• stateless updation of root
• stateless updation of root using subtree

The idea of taking this approach is as follows:

• Having different functions for different operational cases in the verkle trie
• Preserving the Rust types, as according to rust-verkle almost every type has a ser/de
• Dealing with only byte arrays in Java
• Reconstructing the verkle trie in rust if needed, as the not preserving the types and manually trying to tweak the byte arrays before deserialize may cause data loss while porting over from the Java side.

Help Needed:

• Rust uses something called MemoryDB, we need to study it's properties, as for most of the trie operations, values directly from the DB, either we mimic the properties of this DB.
• Or, we figure out a way to enter values from Bonsai.

Note:
Contains unused imports, and maybe some logical bugs for edge cases, feel free to discuss.