Write a program that determines whether every character of the first argument appears, in the same relative order, somewhere inside the second argument.

• The program expects exactly two arguments.
• If the program does not receive exactly two arguments (argc must be 3), print wrong number of arguments followed by a newline.
• Scan the second string from left to right, attempting to match each character of the first string in order.
• If all characters of the first string are matched, print yes followed by a newline.
• If any character of the first string cannot be matched in order, print no followed by a newline.
• Use only write.

Write a program that determines whether every character of the first argument appears, in the same relative order, somewhere inside the second argument.

• The program expects exactly two arguments.
• If the program does not receive exactly two arguments (argc must be 3), print wrong number of arguments followed by a newline.
• Scan the second string from left to right, attempting to match each character of the first string in order.
• If all characters of the first string are matched, print yes followed by a newline.
• If any character of the first string cannot be matched in order, print no followed by a newline.
• Use only write.