One of the earlier applications of cryptographic hash functions was the storageof passwords for user authentication in computer systems. with this method, apassword is hashed after its input and is compared to the stored (hashed) referencepassword. people realized early that it is sufficient to only store the hashed versionsof the passwords.1. assume you are a hacker and you got access to the hashed password list. ofcourse, you would like to recover the passwords from the list in order to impersonatesome of the users. discuss which of the three attacks below allow this. exactly describe the consequences of each of the attacks: attack a: you can break the one-way property of h. attack b: you can find second preimages for h. attack c: you can find collisions for h.2. why is this technique of storing hashed passwords often extended by the useof a so-called salt? (a salt is a random value appended to the password beforehashing. together with the hash, the value of the salt is stored in the list of hashedpasswords.) are the attacks above affected by this technique? 3. is a hash function with an output length of 80 bit sufficient for this application?