The function h′ takes a key k as its parameter, and returns a nonnegative integer that is somehow computed from k. (A more general version of h is discussed on page 272 of Cormen.) Write a procedure called ADDY-HASH-SEARCH that works like HASH-SEARCH, but which computes i² using the fact that the sum of the first n odd integers is n², where n ≥ 0. For example: