1. write a function called dictionarysort() that sorts a dictionary, as defined in programs 9.9 and 9.10 below, into alphabetical order.
/////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////////// program 9.9 // program to use the dictionary lookup program#include #include struct entry{ char word[15]; char definition[50];};bool equalstrings(const char s1[], const char s2[]){ int i = 0; bool areequal; while (s1[i] == s2[i] && s1[i] != '\0' && s2[i] != '\0') ++i; if (s1[i] == '\0' && s2[i] == '\0') areequal = true; else areequal = false; return areequal;}// function to look up a word inside a dictionaryint lookup(const struct entry dictionary[], const char search[], const int entries){ int i; bool equalstrings(const char s1[], const char s2[]); for (i = 0; i < entries; ++i) if (equalstrings(search, dictionary[i].word)) return i; return -1;}int main(void){ const struct entry dictionary[100] = { { "aardvark", "a burrowing african mammal" }, { "abyss", "a bottomless pit" }, { "acumen", "mentally sharp; keen" }, { "addle", "to become confused" }, { "aerie", "a high nest" }, { "affix", "to append; attach" }, { "agar", "a jelly made from seaweed" }