Read the code segment and fill in blank #28. 1. listData 2. predLoc->next 3. location->next 4. newNode->next 5. answer not shown

4 Class Unsorted Type { public: //all the prototypes go here. private: int length; Node Type* listData; }; void UnsortedType: : DeleteItem(ItemType item) // Pre: Item is in list { } NodeType* tempptr; NodeType* predLoc; Node Type* location; bool found= false; location = listData; predLoc= length--; // Find node to delete. while ( ) { switch (_ { case GREATER: ; case LESS break; case EQUAL : found = break; } } // delete location tempPtr = if ( else predLoc= location; location = predLoc->next delete tempPtr; // pointer delete // trailing pointe // traveling point = location->next; =