1. Suppose that a hash table contains HASHSIZE13 entries indexed from 0 through 12 and that the following keys are to be mapped into the table. 10, 100, 32, 45, 58, 126, 3, 29, 200, 400, 0 (a) Determine the hash addresses and find how many collisions occur when these keys are reduced modulo 13 (no insertion, just count colliding hash values) (b) Determine the hash addresses and find how many collisions occur when these keys are first folded by adding their digits together (in ordinary decimal notation) and then reducing modulo HASHSIZE