Recall that the textbook mentions that "computing the hash of an n-bit string should have a running time that is O(n)." Based on this statement, select all the correct statement(s) regarding the running time of computing a hash efficiently: O(input size) O(output size) None of the above