Write an algorithm. There are two computational problems the psychologists must solve:(1) Given a set of students with their values and friendships, and a target T, determine if there aretwo independent cliques of students with total value at least T. This is a YES/NO question.(2) Given a set of students with their values and friendships, find two independent cliques of students with largest possible total value. These two problems seem to be hard to solve efficiently. As usual your manager calls you in and asks you to write programs to solve the two problems. As usual you have no idea how to write such programs. For each problem, you find an efficient program on the Internet that solves that problem. Unfortunately your budget will only allow you to buy one program.