- You are working in teams of four (two sets of partners).
**This will require workplace-style maturity.** - These tasks will test your ability to put notions into practice within a team setting.
- Submit your teams' working code to
`andy at novocin.com`prior to your scheduled review. - I will run the code on real inputs using ideone.com with the C++11 environment.
- Presentation day will consist of a scheduled 45 minute meeting.
- At that meeting I will run the code.
- I will select one person from your team using a random integer, that person will explain the code and answer my questions.
- I will assign a grade that day for all of you based on the randomly selected team member's explanation.
- It is your responsibility to make sure that everyone on your team understands the concepts behind your solution.
- Coding in C++ is a soft requirement of the course, this method allows the coding aspects of the project to be spread while ensuring some practical awareness.

**Input:**A sequence of`m`

lines each with an`n`

length ascii character string`c1c2c3c4...cn1 d1d2d3...dn2 ... z1z2...znm`

The input will come from

`stdin`

. Here`n`

changes from line to line and is not provided to you.

**Output:**`m`

lines each with an integer between`-k`

and`k`

, for some`k`

of your choosing with`k`

\(\leq 2^{32}\) (you may ignore the ability to use negatives).

**Constraints:**Your function is a hash function. Your choice of`k`

can be defended to me. I encourage you to look at popular hashing techniques (here is a list on wikipedia). I am looking for a good uniform spread of the outputs (in particular the printable ascii characters). Implement the hashing yourself, don't just call someone else's hash function.

**Sample instance:**

**Input:**`CaT iN hAt Andy`

**Output:**`1250917240 1409313076`

**Input:**A line to`stdin`

with the integer`m`

. Then`m`

lines of key value pairs to`stdin`

. Each key-value line consists of two character strings separated by four spaces (neither string contains four sequential spaces). Then you will be given a line of three asterisks followed with a line consisting of one key character string.

**Output:**Print a single line containing the second character string from the line which started with the final character string or if no such line was given print`NONE`

.

**Constraints:**I want you to use your hashing function from problem 1 to create a hash table in this problem. Hash the keys, then store the data and key, in an array of length`2*k`

. Discuss the cost of your implementation for large values of`m`

**Sample instance:**

**Input:**`2 key1 value1 key2 value2 *** key1`

**Output:**`value1`