Write the program in C and show the output of the code 1. (Hashing function) Generate a number with greater than 10-digits randomly. (e.g. x = 12320324111220, 2. Implement shift folding and folding at the boundaries to generate an address with 3-digits. 3. Shift folding: Shift all parts except for the last one, so that the least significant bit of each part lines up with corresponding bit of the last part. x1=123, x2=203, x3=241, x4=112, x5=20, address=699. 4. Folding at the boundaries: Reverses every even partition before adding. x1=123, x2=302, x3=241, x4=211, x5=20, address=897.