TfL arrival-processing code needs a small in-memory lookup structure for mapping integer stop IDs to the latest value received from TfL Countdown. Implement a basic hash table without using the built-in dict or set for storage.
Use separate chaining: the table must contain a fixed number of buckets, and each bucket stores a list of key-value pairs. The function receives operations and returns the results of all get and delete operations in their original order.
Implement hash_table(operations, bucket_count), where operations is a list containing:
['put', key, value], which inserts or replaces a key-value pair.['get', key], which returns the value for key, or None if absent.['delete', key], which removes key if present and returns True, otherwise returns False.key is an integer and value is an integer. Return a list containing only results from get and delete operations.
def hash_table(operations, bucket_count):