Let h : {0, 1} * ? {0, 1} n be a hash function that is second-preimage and collision resistant. Let.

Let h : {0, 1} * ? {0, 1} n be a hash function that is second-preimage and collision resistant. Let h 0 : {0, 1} * ? {0, 1} n+1 be the hash function given by the rule h 0 (x) = 0||x x ? {0, 1} n , 1||h(x) otherwise. Prove that h 0 is not preimage resistant, but still second-preimage and collision resistant.