Extendable hashing [12]. Redo the example appearing in Lecture Notes with input shown in slide, using the same data structure and same assumption (duplicated below for your convenience), but this time you should insert them in reverse order (namely, record with A-305 will be inserted first, followed by record with A-222, etc.). Show your work: At least for each directory split, a new figure should be included in your answer.

A-217	Brighton	750
A-101	Downtown	500
A-110	Downtown	600
A-215	Mianus	700
A-102	Perryridge	400
A-201	Perryridge	900
A-218	Perryridge	700
A-222	Redwood	700
A-305	Round Hill	350