For this project you will create a recursive data structure to hold your family tree $($use ANY tree data structure you want$).$ It doesn$$t have to be your family, any family of your choosing $($you could use The Simpson$$s or another family$).$ We will represent a family by creating a Person object. The Person object should have at least three fields: name, mom, and dad. Each of the mom and dad fields will either be null or will $$point to$$ another Person object $($which is what makes it recursive$).$ For example, you might create objects like the following example:

Person me $=$ new Person$($Sarah Jessica Parker$)$;

me$.$dad $=$ new Person$($Father Parker$)$;

me$.$mom $=$ new Person$($Mother Parker$)$;

me$.$mom.dad $=$ new Person$($Grandfather on Mom's side$)$;

Make a family tree with at least four generations, even if you have to make up people. Connect all of the people in your tree in the appropriate manner. To do this, you can add additional methods to your class. For example, you might want to have a method that works like this:

me$.$addParents$($John Smith$,$Jane Doe$)$;

That could be implemented like so:

class Person $\{$

Person mom;

Person dad;

$...$

void addParents$($String father$\_$name, String mother$\_$name$)\{$

this.dad $=$ new Person$($father$\_$name$)$;

$...$

$\}$

$\}$

You could write a recursive function to count how many people are in your tree like so:

class Person $\{$

$...$

int count$()\{$

int sum $=1$; $//$ that is you!

if $($mom $!=$ null$)\{$

sum $+=$ mom.count$()$;

$\}$

if $($dad $!=$ null$)\{$

sum $+=$ dad.count$()$;

$\}$

return sum;

$\}$

$\}$

System.out.println$($The tree has $+$ me$.$count$()+$ people in it$.)$;