Question $2$: Write True or False beside each of the statements:

$]=[30$ marks

In a Map, multiple items can have the same key.

The del $($del M$[$k$])$ and pop $($M$.$pop$($k$,d=$ None$))$ operations are same for a map M$.$

Compression function maps the hash code to an integer within a range of indices.

The main goal of hash code is to make collisions as much as possible.

Only immutable data types are hashable.

For character strings, python uses hash codes similar to cyclic$-$shift hash code.

Linear probing is an example of open addressing scheme.

In a red$-$black tree the root is always colored red.

A newly inserted node in a red$-$black tree is always colored red if the tree is not empty.

Merge$-$sort algorithm solves a problem by recursively solving the subproblems and then merging the solutions.

Quick$-$sort is an in$-$place sorting algorithm.

In depth$-$first graph search most recently visited nodes are explored first.

We can use Dijkstra's shortest path algorithm in graphs where some of the edges have negative weights.

Dynamic programming ensures that same subproblem is not solved multiple times.

To avoid worst case running time of quick$-$sort, first element of the sequence is chosen as pivot.