The “prime number division remainder” method is a well-known hashing algorithm.   In this method, a key value is divided by a number N, and the remainder which is also called a hash value is used directly as an index into the hash table.   N is the largest prime number less than or equal to the size of the table.   When the table size is 20, which of the following is the correct hash value calculated from the key value 136?   Here, a prime number is one that cannot be divided evenly by any other number except one (1).   2, 3, 5, 7, 11, and 13 are the first few prime numbers.