[resharding] Implement building new tries by using flat storage.

[shreyan-gupta]

Currently for resharding when splitting the parent shard trie to the child shard tries, we are iterating over all the key value pairs in the parent trie. Instead of doing that, we can be more efficient by iterating over flat storage key, value pairs.

Tasks

Beta Give feedback

1. [resharding] Base implementation using flat storage #9433
   +0
   
2. [resharding] Add metrics for resharding #9434
   +0
   
3. [resharding] Optimize writing trie key, value entries from parent trie to child tries #9435
   +0
4. [resharding] Use state sync snapshots to get flat storage iterator at a precise block #9436
   +0
   
5. [resharding] Shift from trie iteration implementation to flat storage implementation #9446
   +0
   
6. [flat_storage] Expose flat storage manager from Tries #9447
   +0