write for JAVA CODE

Hash Collisions

Problem:

Receive as input an array of strings.

Return the set of strings which collide in the hash table in the order they appear in the input list.

The hash algorithm should be implemented as the sum of the ASCII values of the lower-cased letters. For example, Bob, bob, and obb all hash to the same number.

Example input:

{ "inList" : [ "Bob", "boj", "obb", "job", "BOB", "foo" ] }

Example output:

{"outList": [[ "Bob", "obb", "BOB" ] ,[ "boj", "job" ]]}

Do not output strings which do not collide, such as foo in the example above. If the table has no collisions, return the empty array. { "outList" : [ ] }

Erroneous input (e.g. malformed JSON) should be handled gracefully with appropriate error messages.