Consider the following simplified version of the multiple sequence alignment problem defined on page $5.$ We are given a list of $5$ genetic strings each of length $10,$ and we seek an alignment that inserts exactly $3$ spaces in each of the strings. We use a computer program to find the best alignment using brute force: that is$,$ we test every possible way of inserting $3$ spaces into the $10-$character strings. Approximately how many possibilities need to be tested? If we can test one billion possibilities per second, what is the running time of the program? What if there are $20$ genetic strings instead of $5!$ If there are N genetic strings, what is the approximate running time in terms of N$?$