In C$++,$ we will be implementing a hash table that stores strings. I need help with creating the hash function: int hash$($string s$)$ that converts strings into indexes. This function must COMPLETELY follow these principles: $1)$ Determinism $($same input must map to the same index$),2)$ Speed $($method MUST run in O$(1)$ time$),3)$ Spread $($related but different inputs should map to unrelated indexes, and all indexes must be used$).$ Table must have exactly $31$ indexes.