Suppose we have computed signatures for a number of columns, and each signature consists of 24 integers, arranged as a column of 24 rows. there are n pairs of signatures that are 50% similar (i. e., they agree in half of the rows). there are m pairs that are 20% similar, and all other pairs (an unknown number) are 0% similar. we can try to find 50%-similar pairs by using locality-sensitive hashing (lsh), and we can do so by choosing bands of 1, 2, 3, 4, 6, 8, 12, or 24 rows. calculate approximately, in terms of n and m, the number of false positive and the number of false negatives, for each choice for the number of rows. then, suppose that we assign equal cost to false positives and false negatives (an atypical assumption). which number of rows would you choose if m: n were in each of the following ratios: 1: 1, 10: 1, 100: 1, and 1000: 1? identify the correct choice from the list below.