Problem 5.3 A stack of words (3 points) Due by Tuesday, March 5th, 10:00 AM Graded manually Modify the struct from Problem 5.1 and write a program that tests a stack of words (the words will not be longer than 30 characters). Keep in mind the functions strcpy(), strcmp() and strcat(). Use the word stack to check if a sentence (assume that the words are separated by spaces, all letters are lowercase and no punctuation marks are contained) is palindromic by words. For example, the sentence dogs like cats and cats like dogs is palindromic by words, because it reads the same from backwards (word by word). The program should terminate its execution if "exit" is entered as a sentence. Your program should consist of one header file and two .c files (i.e., stack.h, stack.c and wordstack.c). You can assume that the input will be valid. To pass the testcases your output has to be identical with the provided ones. Testcase 5.3: input Testcase 5.3: output dogs like cats and cats like dogs bob likes tomatos do not like bob exit The sentence is palindromic by words! The sentence is not palindromic by words