Recall The List ADT. Suppose Its Interface Is Extended As Below. Mainly We Include The Following Prototype Into List.H: Void RemoveOddValues (ListADT A) Which Removes/Deletes The Odd Values From The List. So At The End List Will Contain Only Even Values. Implement It Based On The Structures Given Below fnde F List H #Define-Listh- - Typedef

start-NULL; tmp->end = NULL; return (tmp) / implementations of other functions*/\" v:shapes=\"Picture_x0020_43\">

suppose standard and book libraries are included too */ #include \"list.h\" typedef struct point int xi struct point *next; myDataT; struct listCDT myDataT start; myDataT *end; listADT NewList ) listADT tmp; tmp New (listADT) tmp->start-NULL; tmp->end = NULL; return (tmp) / implementations of other functions*/

\\