DNA sequences (dnaSearch. c) A DNA sequence is a sequence of some combination of the characters A (adenine), C (cytosine), G (guanine), and T (thymine) which correspond to the four nucleobases that make up DNA. Given a long DNA sequence, it is often necessary to compute the number of instances of a certain subsequence. For this exercise, you will develop a program that processes a DNA sequence from a file and, given a subsequence , searches the DNA sequence and counts the number of times s appears. As an example, consider the following sequence: If we were to search for the subsequence GTA, the output will be: Sample Output: GTA appears 2 times You will write a program (place your source in a file named dnaSearch. c) that takes, as command line inputs, an input file name and a valid DNA (sub)sequence. That is, the file name and the DNA subsequence should be callable from the command line as follows: ./dnaSearch dna01.txt GTA Note: You are not allowed to use the string library "strstr" function, which will result into a 0 score. You have to submit the following file containing the solution of this program via handin: dnaSearch. c