Consider a cuckoo hashing scheme using two hash tables of size 10 and using hash functions h1 and h2. Apply this scheme to insert the following sequence of keys to the initially empty tables: {29,38,51,41,36,99,123,9,4,68,149,59}. The values of h1 and h2 for the keys are given below. Indicate the state of the two tables after each insertion. Write 1 if it does not exist