def main$()$:

$"""$

Builds the required data structures for the program.

$"""$

# Dictionary containing room number as key

sensors $=\{$

$"4213"$: $("$STEM Center", $0),$

$"4201"$: $("$Foundations Lab", $1),$

$"4204"$: $("$Computer Science Lab", $2),$

$"4218"$: $("$Workshop$",3),$

$"4205"$: $("$Tiled Room", $4),$

"Out": $("$Outside$",5)$

$\}$

# Create sensor list

sensor$\_$list $=[($room$\_$num, room$\_$desc, sensor$\_$num$)$ for room$\_$num, $($room$\_$desc, sensor$\_$num$)$ in sensors$.$items$()]$

# Create filter list

filter$\_$list $=[$sensor$\_$num for $\_,(\_,$ sensor$\_$num$)$ in sensors$.$items$()]$

# Example: Searching room $4213$

search$\_$room $="4213"$

if search$\_$room in sensors:

print$("$Room found:", sensors$[$search$\_$room$])$

else:

print$("$Room can't be found."$)$

# Print the created lists

print$("$Sensors List:", sensor$\_$list$)$

print$("$Filters List:", filter$\_$list$)$

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

main$()$ Assignment: Add the function recursive$\_$sort$()$ which has as its parameters, list$\_$to$\_$sort $($a list of tuples like the one you just made$)$ and key.

key should have a default value of zero, and refers to whether the list should be sorted by the first or second value in the tuple.

Of course, recursive$\_$sort$()$ should call itself as part of the process.

When exchanging the items in the list use tuple unpacking

The sorted part of the list will be growing from the end of the list $($the greatest value$).$

Each time you call recursive$\_$sort, you should be calling with a smaller list.

You can use slicing for this.