asap please

EENG212: SEMESTER HOMEWORK (to be submitted by 27 December 2023) Description: Assume that there is a binary tree where each note contains information about an individual. Right pointer leads you to the Mother's information and the left pointer leads you to the father's information of that individual. Information in each node contains the following: Name, Surname, Date of birth, Place of Birth (only a single Word). Date of death (if passed away). Occupation (only a single Word). Task: Write a program that creates a tree such that you are at the root and the leaves lead you to your mother and father. Further down in the tree leads you to your grandparents. Try to give information to make your tree as deep as possible. Have a menu to; - insert into the tree, - search through the three (i.e finding the oldest member of the family). - list the alive from youngest to oldest, - list the family members that have passed away