HW#$2,$ you were asked to construct a linked list of address$\_$t structures, each of which contained the four integers of an IPv$4$ address along with a fifth component in which to store an associated alias of up to $10$ characters. In this project, you will replace the linked list with a Binary Search Tree $($BST$).$ All edit checks for HW#$2$ apply to HW#$3$ regarding range checking for the IPv$4$ octets $[0,255]$ and alias length $[1,10]$ printable characters. For this exercise, the CS$531\_$Inet.text file may have errors. If any of the following errors occur within the CS$531\_$Inet.txt file, the record must be written out to the text file: CS$531\_$error$-$log $($see test case example$),$ and omitted from the BST$.$ Possible errors within CS$531\_$Inet.txt may include: $$ IPv$4$ address does not parse into four legal integers. $$ The alias length is greater than ten characters $($note: $$

$$ is not a legal character within an alias$).$ The alias contains one or more uppercase letters. Again, you will create a structure type called address$\_$t similar to that used in HW#$2,$ with the following modifications needed to convert the linked list to a BST$.111\mathrm{.}22\mathrm{.}3\mathrm{.}44$ platte $131\mathrm{.}250\mathrm{.}95\mathrm{.}21$ jet $172\mathrm{.}66\mathrm{.}7\mathrm{.}88$ wabash $111\mathrm{.}22\mathrm{.}5\mathrm{.}66$ green $131\mathrm{.}250\mathrm{.}47\mathrm{.}63$ baker As with HW#$2,$ for this assignment, you will create your own test data files using the sample format. Grading will involve using different data files with the same format. $111\mathrm{.}22\mathrm{.}3\mathrm{.}44$ platte $131\mathrm{.}250\mathrm{.}95\mathrm{.}21$ jet $131\mathrm{.}350\mathrm{.}3\mathrm{.}4\mathrm{.}5$ smith $172\mathrm{.}66\mathrm{.}7\mathrm{.}88$ wabash $111\mathrm{.}22\mathrm{.}5\mathrm{.}66$ green $172\mathrm{.}333\mathrm{.}32\mathrm{.}5$ smith$2131\mathrm{.}250\mathrm{.}47\mathrm{.}63$ baker $111\mathrm{.}22\mathrm{.}5\mathrm{.}77$ abercrombie $131\mathrm{.}250\mathrm{.}62\mathrm{.}33$ Sanders struct address$\_$t $\{$ int octet$[4]$; char alias$[11]$; struct address$\_$t $*$leftChild$,*$rightChild$,*$parent; int height, depth; $\}$ struct address$\_$t $*$head $=$ NULL; As CS$531\_$Inet.txt is being read in$,$ those records that do not contain errors will be stored in the BST composed of address$\_$t structures containing the address$/$alias pairs read in from the file. Once the BST has been created, the user will receive the following menu options: $1)$ Add address $2)$ Look up address $3)$ Update address $4)$ Delete address $5)$ Display list $6)$ Display aliases for location $7)$ Display Error Log $8)$ Quit Program Structure and Design $$ displayList$()$ and displayAliasesForLocation$()$ shall be based on Inorder Traversal. $$ displayList$()$ will display the alias, address, height, depth, and parent$$s alias for each node. $$ deleteAddress$(),$ lookUpAddress$(),$ and displayAliasesForLocation$()$ will display an error message if the alias $($or location$)$ entered is not listed. Following the error message, the menu will be redisplayed. $$ A separate UDF will be defined as an entry point for each menu option. These $8$ functions must each be properly prototyped and documented as discussed. $$ No duplicate aliases or address are allowed. If attempted, display an appropriate error message followed by the menu. $$ For this exercise, all aliases entered by the user must be converted $($by your program$)$ to lower case. Rubric $(10$ points$\}$ Is the source code well documented and formatted using clearly readable indentation and white space $($while viewed within vi$)?1$ point $$ displayList$()$ must display the correct alias, address, height, depth, and parent$$s alias for each node in order to receive credit $($all or none$).2$ points $$ Does each menu option $(1-7)$ map to its own UDF, and is each UDF properly implemented? $7$ points $1$ global variable may be used. Each additional global variable will cost $1$ point $$ UDFs not prototyped and documented will cost $1$ point $$ Error Log entries not omitted from the BST will cost $1$ point $$ Test scenario: $($sample CS$531\_$Inet.txt$)$ Based on the sample data discussed above, an example run of the program may look as follows. Please note: This is not an exhaustive scenario and not every error condition discussed above is illustrated. $1)$ Add address $2)$ Look up address $3)$ Update address $4)$ Delete address $5)$ Display list $6)$ Display aliases for location $7)$ Display Error Log $8)$ Quit $111\mathrm{.}22\mathrm{.}3\mathrm{.}44$ platte $131\mathrm{.}250\mathrm{.}95\mathrm{.}21$ jet $131\mathrm{.}350\mathrm{.}3\mathrm{.}4\mathrm{.}5$ smith $172\mathrm{.}66\mathrm{.}7\mathrm{.}88$ wabash $111\mathrm{.}22\mathrm{.}5\mathrm{.}66$ green $172\mathrm{.}333\mathrm{.}32\mathrm{.}5$ smith$2131\mathrm{.}250\mathrm{.}47\mathrm{.}63$ baker $111\mathrm{.}22\mathrm{.}5\mathrm{.}77$ abercrombie $131\mathrm{.}250\mathrm{.}62\mathrm{.}33$ Sanders Enter menu option: $5$ baker $131\mathrm{.}250\mathrm{.}47\mathrm{.}63$ height:$0$ depth:$3$ parent:green green $111\mathrm{.}22\mathrm{.}5\mathrm{.}66$ height:$1$ depth:$2$ parent:jet jet $131\mathrm{.}250\mathrm{.}95\mathrm{.}21$ height:$2$ depth:$1$ parent:platte platte $111\mathrm{.}22\mathrm{.}3\mathrm{.}44$ height:$3$ depth:$0$ parent: NONE wabash $172\mathrm{.}66\mathrm{.}7\mathrm{.}88$ height:$0$ depth:$1$ parent:platte $($note that option $5$ displays the list in alphabetical order, due to the inorder traversal$)$ Enter menu option: $6$ Enter Locality: $131\mathrm{.}250$ Location: $131\mathrm{.}250$ baker jet Enter menu option