Problem Statement Bitcoin mining involves finding a SHA-256 hash of recent Bitcoin transactions with a certain number of leading zeroes (currently 17). A hash function takes in a string, and outputs...

Please code in java.

Extracted text: Problem Statement Bitcoin mining involves finding a SHA-256 hash of recent Bitcoin transactions with a certain number of leading zeroes (currently 17). A hash function takes in a string, and outputs another string, which it derives by extracting unique features of the input. In this lab the goal is to compute a hash of a set of input strings, and identify the two strings with the "closest" hashes, defined as the number of hexadecimal digits their SHA- 256 hashes share in common. Of this pair, print out the one which came earliest in the input list. If there are several competing pairs with the same quantity of shared hexadecimal digits, then just print out the string in that group which came earliest in the input list. Input Format The first line contains N(number of words) followed by Nlines. Each line contains a string. Output Format Print out the input string matching the above criteria.