Remember to follow the Expectations on Homework when preparing your solutions.
create-person that consumes a person's name and returns a new person with the given name (and no friends).
The new person should also be added to the network. You may assume the named person does not already exist in the network.
create-person to populate the social network network with at least 5 different persons.
(You may wish to "define" these new persons so you can refer to them in later exercises.)
connect-friends that consumes two persons, and makes them each a friend of the other.
(A person A is a friend of person B if person A's friend list contains B and vice versa.) You may assume that the
given persons are not already friends. Your function should return void.
connect-friends to establish at least 5 friend pairs in network.
find-person that consumes the name of a person and returns that person if it exists in
network, or returns the string "not found" otherwise. Provide test cases for this function and any helpers you write.
most-social that consumes nothing and returns the person with the most friends
(resolve ties arbitrarily). Return "empty network" if network doesn't contain any persons.
You may use the Scheme built-in function length.
Using web-based turnin, turn in a single file hw12.scm containing all code and documentation for this assignment. Please make sure both partners' names and wpi login names are listed in a comment at the top of the file.