B 4.1.6 Worksheet 3 Python
Name: _________________________ Scenario: You have an empty hash table of size 7 (indices 0-6). Hash Function: index = key % 7 Keys to insert in order: 15, 8, 22, 1, 16, 23 1. Linear Probing Sketch the final state of the array after inserting all the keys using linear probing to resolve collisions. | Index 0 | Index 1 | Index 2 | Index 3 | Index 4 | Index 5 | Index 6 | | | | | | | | | 2. Chaining Sketch the final...