A Fibonacci string is defined as follows: s1 = b s2 = a sk = sk1sk2

Write a C/C++ program that recognizes strings of the form . s6. . These strings are of the form of zero or more characters followed by s6 followed by zero or more characters. The string will be passed into your program using command line arguments. Do not prompt the user for the input string. The input string will be a maximum of 80 characters. Your program will only output the strings either STRING ACCEPTED or STRING NOT ACCEPTED (nothing more, nothing less). You may not use the the string.h function strstr(). Your program must use recursion to recognize the string. Name this program csf hw1 q3.c. Include sample output in your solution. A Fibonacci string is defined as follows: s1 = b s2 = a sk = sk1sk2 Write a C/C++ program that recognizes strings of the form . s6. . These strings are of the form of zero or more characters followed by s6 followed by zero or more characters. The string will be passed into your program using command line arguments. Do not prompt the user for the input string. The input string will be a maximum of 80 characters. Your program will only output the strings either STRING ACCEPTED or STRING NOT ACCEPTED (nothing more, nothing less). You may not use the the string.h function strstr(). Your program must use recursion to recognize the string. Name this program csf hw1 q3.c. Include sample output in your solution.