We have n people in a room, where n is an integer greater than or equal to 1. each person shakes hands once with every other person. what is the total number, h(n) , of handshakes? write a recursive function to solve this problem. to get you started, if there are only one or two people in the room, then handshake(1) = 0 handshake(2) = 1 if a third person enters the room, he or she must shake hands with each of the two people already there. this is two handshakes in addition to the number of handshakes that would be made in a room of two people, or a total of three handshakes. if a fourth person enters the room, he or she must shake hands with each of the three people already there. this is three handshakes in addition to the number of handshakes that would be made in a room of three people, or six handshakes. if you can generalize this to n handshakes, you should be able to write the recursive solution.