Implement MerkleStore::{with_tiered_smt, add_tiered_smt}

[vlopes11]

Following the same pattern to add leaves of other algorithms into the MerkleStore, we should introduce the following methods:

MerkeStore::with_tiered_smt<R, I>(
    mut self,
    entries: R
) -> Result<Self, MerkleError>
where
    R: IntoIterator<IntoIter = I>,
    I: Iterator<Item = (Word, Word)>

MerkeStore::add_tiered_smt<R, I>(
    &mut self,
    entries: R
) -> Result<Word, MerkleError>
where
    R: IntoIterator<IntoIter = I>,
    I: Iterator<Item = (Word, Word)>

with_tiered_smt will be a builder pattern, and add_tiered_smt will return the new root.

The inclusion should follow the implementation described in #22

Originally posted by @bobbinth in 0xPolygonMiden/miden-vm#808 (comment)

[bobbinth]

Closed by #153.