Consider a singly-linked list of integers and "your node" declaration below. Assume the list is sorted. class DB Node public: int number; DB Node *next;}; class DB List {public: void Delete_All_Evens();//deletes all even integers from the list void Insert_Anywhere(int key);//insert key in the correct place in the sorted list}; private: DB Node *front;//points to the front of the list}; a. Using the classes define above (DB_Node and DB_List) implement the function Delete AM Evens. b. Using the classes define above (DB_Node and DB_List) implement the function Insert Anywhere