This is the code provided in the InsertionAlgorithm block:

def insert$($index$)$:

global directory

global bucket$\_$number

t$\_$id $=$ index$[0]$

hash$\_$key $=$ hash$\_$funtion$($int$($t$\_$id$))$

hash$\_$prefix $=$ int$($hash$\_$key$[-$directory.global$\_$depth$[0]$:$],2)$

bucket $=$ directory.directory$\_$records$[$hash$\_$prefix$].$value

bucket.index.append$($index$)$

bucket.empty$\_$spaces $=$ int$($bucket$.$empty$\_$spaces$)-1$

if$($bucket$.$empty$\_$spaces $<mtext></mtext><mn>0</mn><mi>)</mi>$:

tempopary$\_$memory $=$ bucket.index

bucket.empty$\_$spaces $=$ bucket$\_$capacity

bucket.index $=[]$

if $($directory$.$global$\_$depth$[0]>$ bucket.local$\_$depth$)$:

# NUMBER OF LINKED BUCKETS

number$\_$of$\_$links $=2**($directory$.$global$\_$depth$[0]-$ bucket.local$\_$depth$)$

bucket.local$\_$depth $=$ bucket.local$\_$depth $+1$

number$\_$of$\_$modify$\_$links $=$ number$\_$of$\_$links$/2$

new$\_$bucket $=$ Bucket$($local$\_$depth $=$ bucket.local$\_$depth, index$=[],$ empty$\_$spaces $=$ bucket$\_$capacity, id $=$ bucket$\_$number$)$

for directory$\_$record in directory.directory$\_$records:

if$($directory$\_$record.value $==$ bucket$)$:

if$($number$\_$of$\_$modify$\_$links $!=0)$:

number$\_$of$\_$modify$\_$links $=$ number$\_$of$\_$modify$\_$links $-1$

else:

directory$\_$record.value $=$ new$\_$bucket

bucket$\_$number $=$ bucket$\_$number $+1$

for i in range$($len$($tempopary$\_$memory$))$:

insert$($tempopary$\_$memory$[$i$])$

elif $($directory$.$global$\_$depth$[0]==$ bucket.local$\_$depth$)$:

new$\_$directory$\_$len $=2*$ len$($directory$.$directory$\_$records$)$

new$\_$directory$\_$records $=[]$

for directory$\_$record$\_$number in range$($new$\_$directory$\_$len$)$:

new$\_$directory$\_$records.append$($DirectoryRecord$($hash$\_$prefix$=$directory$\_$record$\_$number,bucket$=$Bucket$($local$\_$depth$=1,$index$=[],$empty$\_$spaces$=$bucket$\_$capacity,id$=$bucket$\_$number$)))$

bucket$\_$number $=$ bucket$\_$number $+1$

new$\_$directory $=$ Directory$($global$\_$depth$=$directory.global$\_$depth$[0]+1,$directory$\_$records$=$new$\_$directory$\_$records$)$

# REHASING

for directory$\_$record in directory.directory$\_$records:

haskey$1=\text{'}0\text{'}+$hash$\_$funtion$($directory$\_$record.hash$\_$prefix$)$

haskey$2=\text{'}1\text{'}+$hash$\_$funtion$($directory$\_$record.hash$\_$prefix$)$

new$\_$index$1=$ int$($haskey$1[-$directory.global$\_$depth$[0]$:$],2)$

new$\_$index$2=$ int$($haskey$2[-$directory.global$\_$depth$[0]$:$],2)$

new$\_$directory.directory$\_$records$[$new$\_$index$1].$value $=$ directory$\_$record.value

new$\_$directory.directory$\_$records$[$new$\_$index$2].$value $=$ directory$\_$record.value

directory$=$ new$\_$directory

for i in range$($len$($tempopary$\_$memory$))$:

insert$($tempopary$\_$memory$[$i$],$lock$)(2)$ We have provided you with the code for extendible hashing. Run the code with various

use$-$cases so you can demonstrate the ownership of the code. Provide code reflections in fol$-$

lowing forms:

a$)$ Evidence of running the code with various use$-$cases $-$ e$.$g$.,$ changing the number

of buckets, reading data from external files, simulating data generation, etc.

$-$b$)$ Modification of the code to obtain different behaviour $-$ e$.$g$.,$ use of dictionaries

instead of lists, refactoring code into various functions or classes, etc.

$-$c$)$ Detail comments of various lines of the code explaining which part of the algorithm

it is executing, this can be in form of detailed inline comments or adding paragraph

cells in the juypter notebook.

This is a third$-$party code, we welcome you to do a complete overhaul of the code or write

the code from scratch.

Your tutor will ask you various questions about the code and its inner working, you should

be able to explain it$.$ return $\text{'}\{\backslash$theta:$16$b$\}\text{'}.$format$($key$)$

class Bucket: self.id $=$ id self.index $=$ indexclass Directory: self.global$\_$depth $=$ global$\_$depth,class DirectoryRecord: self.hash$\_$prefix $=$ hash$\_$prefix Hyper Parameters

$[18]$: bucket$\_$capacity $=3$

bucket$\_$number $=4$

global$\_$depth $=2$

$[19]$: # Initialization of buckets

bucket$1=$ Bucket$($local$\_$depth $=1,$ empty$\_$spaces $=$ bucket$\_$capacity, index $=[],$ id $=1)$

bucket $2=$ Bucket$($local$\_$depth $=1,$ empty$\_$spaces $=$ bucket$\_$capacity, index $=[],$ id $=2)$

# Initialization of directory

directory$\_$records $=$ list$()$

directory$\_$records.append$($DirectoryRecord$($hash$\_$prefix $=,$ bucket $=$ bucket$1))$

directory$\_$records.append$($DirectoryRecord$($hash$\_$prefix $=1,$ bucket $=$ bucket$2))$

directory