On rabbit, the file "/home/118/people1.txt" contains data for exactly 1000 people, in this format:

114680858 19670607 Matilda Vincent 71734
114930037 19471024 Desdemona Hanover 69743
115550206 19790110 Xanadu Perlman 12193
116520629 19630921 Alexander Hall 94976
117050976 19301016 David Lamprey 50895
119610646 19650202 Thomas Porlock 83582
120330928 19621126 Cary Cartman 90387
122460462 19620411 Bella Oldman 94495
123040628 19220213 Elizabeth Watson 90369
123580905 19230308 Gustav Hornswaggle 37568
125040813 19840613 Godfrey Tumor 55645
125610677 19580903 Gustav Trentham 73590 

The entries on each line are social security number, date of birth, first name, last name, and
bank balance.

There are other files called
    /home/118/people1.txt
    /home/118/people2.txt
    /home/118/people3.txt
    /home/118/people5.txt
    /home/118/people10.txt
    /home/118/people20.txt
    /home/118/people30.txt
    /home/118/people50.txt
    /home/118/people100.txt
people(N).txt contains data on (N) thousand people.

Write a program that can read any one of those files, and store all the people in a binary tree
sorted by name (last name first, then first name)

Once the data has been read and the tree hash been built, intercat with the user. The user will
always enter two strings on a line

  print all = print the entire tree, in order, one person per line
  F L       = search for the person named F L, and print everything known about them
  stop it   = exit from the program