Question $2$ Assuming that you can only substitute one pattern, provide the pattern of zeros and ones that can be replaced to yield an outputted file with the fewest number of total characters. So for this question provide the optimal pattern of zeroes and ones that compresses the file to the fewest number of total characters. For this question your answer needs to be a bash command that searches for a sample pattern of zeros and ones.