Q$6.$ In a linked list implementation of Merge Sort, the linked list needs to be divided

recursively from the middle. After dividing, the sublists can then be merged back in a sorted

manner. Describe how you would divide the linked list and provide the $C++$ implementation

for this process.Q$1.$ A strictly binary tree is defined as a tree whose nodes are either leaf nodes or have $2$

children. Write a recursive member function for the BinaryTree class that returns true if a tree

is a strictly binary tree, false otherwise.

Q$2.$ Write a program to find the missing passengers of a flight to be used in an airport. First,

read the information of passengers $($id and name$)$ who have bought a ticket for a certain flight

from a text file and insert them into a Binary Search Tree sorted according to passenger

names. A sample text file is shown below:

Then from the keyboard, read the names of passengers who have boarded the plane and

delete them from the Binary Search Tree. Continue this process until $0$ is inputted. To

announce the missing passengers at the airport, output the ids and names of all the

passengers alphabetically who have not yet boarded the plane as seen in the sample run.

Sample Run:

Enter passenger names who have boarded the plane ending with a $0$ :

GulDemir

AhmetTurkoglu

$...$

$0$

Missing Passengers:

$12004455$ AhmetOzkan

$11223344$ CemilUzun

HEADER FILES...