Hash functions and dynamic programming algorithm help

DO NOT WRITE ACTUAL CODE, ONLY PSUEDO CODE!!!!!!!!!!!!!!!!!

For the input 0, 13, 26, 14, 15 and hash function h(k) = kmodl3 Construct the open hash table Find the largest number of kcy comparisons in a successful search in this table. Find the average number of key comparisons in a successful search in this table. For the input 0, 13, 26, 14, 15 and hash function h (k) = kmod13 Construct the closed hash table. Find the largest number of key comparisons in a successful search in this table. Find the average number of key comparisons in a successful search in this table. Apply the dynamic programming algorithm to find all the solutions to the change-making problem for the denominations 1, 2, 5 and the amount n = 11