For a table n×9 (n rows and 9 columns), determine the maximum of n that we can write one number in the set {1,2,...,9} in each cell such that these conditions are satisfied:1. Each row contains enough 9 numbers of the set {1,2,...,9}.2. Any two rows are distinct.3. For any two rows, we can find at least one column such that the two intersecting cells between it and the two rows contain the same number. combinatorics proposedcombinatorics