Implement Porter’s stemming algorithm in the programming language of your choice. You will need to find a full description of the algorithm. You can find this in Porter (1980), Spärck Jones (1997), or online. Apply the algorithm to a dictionary of words, such as the one that comes with most UNIX implementations. Then allow a user to enter a word, and have the system look this word up and say “yes” if it is present in its stemmed form in the dictionary or “no” if it is not. For example, if the dictionary contains swim, fish, and cheese, then it should say “yes” to swimming, fishing, and cheeses but no to chocolate and swam.