We have n people in a room, where n is an shakes hands once with every other person 1. (30 points) Recursive handshake application: to solve ereater than or equal to 1. Each person What is the total number handshake (nj of this problem. Here are example. handshake(-3, handshake(9-6, handshake(s)-e enters the room, she must shake hands with each of the two people already handshake(a)-0, handshake(2)-s, a third person there. This is two hands a room of two people, or a total of 3 handshakes. If you can generalize this to n then it should help you write the recursive solution hakes in addition to the number of handshakes that would be made in handshakes How many people are in the room? 5 If everyone shakes hands once, there will be 18 handshakes. import java.uti1 public class RecursiveHandShake ( public static void main(Stringi] args) t int numpeople; int num_handshakes; Scanner input new Scanner(System.in); System.out.println("How many people are in the room?") num_people input.nextInt); num_handshak Kes P handshakes (num people) hands once," +there will be num_handshakeshandshakes.") + "there will be" Your answer: Recursive handshakes function