Consider the sequence of values S=[12,44,13,88,23,94,11,39,20,16,5]. P1.1. Draw the binary search tree obtained by adding the values in S in sequence. P1.2. Draw the red-black tree obtained by adding the values in S in sequence. P1.3. Consider the hash-function h(k)=(2k+5)mod11 and a hash-table of 11 table entries that uses hashing with separate chaining. Draw the hash-table obtained by adding the values in S in sequence. P1.4. Consider the hash-function h(k)=(3k+2)mod11 and a hash-table of 11 table entries that uses hashing with linear probing. Draw the hash-table obtained by adding the values in S in sequence