$[$Programming Problem$]$

Problem$16$ is implementation of Dummy Sorted Linked List. In dummy sorted linked

list, List has a dummy node. Node is inserted by ascending order.

In this problem, Person is base class and Student & Worker are derived class. List

handles derived classes as node through pointer of bass class.

Implement Student.cpp

$(1)$ Implement functions of Student

$(2)$ Refer Person.cpp$,$ Person.h$,$ Student.h$,$ main.cpp

$(3)$ Result of Printinfo function is like below

Nane : Choi, Age : $20,$ Major : EEE

Nane : Kim, Age : $21,$ Hajor : EEE

You can write the function declared in $*$student$.$h in student.cpp$.$

Implement Worker.cpp

$(1)$ Implement functions of Worker

$(2)$ Refer Person.cpp$,$ Person.h$,$ Worker.h$,$ main.cpp

$(3)$ Result of Printinfo function is like below

Nane : Lee, Age : $25,$ Company : Samsung

Nane : Park, Age : $26,$ Company : LG

You can write the function declared in $*$Worker$.$h in Worker.cpp$.$

$-$Implement Problem $36$ in Sort$\_$List.cpp

Implement List:: List$()$

$(1)$ Free all memory allocated for nodes

Implement void List::PrintList$()$

$(1)$ Print out all nodes' data in List from first node to last node

$(2)$ Use Nodes' Printinfo function

$(3)$ If List is empty, Print out "Empty"

Implement void List::Insert$($Person $*$new$\_$Person$)$

$(1)$ Link argument at proper position in list by ascending order for name

Implement void List::Delete$($const char $*$name$)$

$(1)$ Delete node whose member variable "name" is same with Argument "name"

$(2)$ If there aren't any nodes that satisfy condition, Print out "Name is not found

in List"

$(3)$ If List is empty, Print out "Empty"

$-$You can use Strcmp$,$ Strlen, Strcpy$.$