Question

Lisa is launching a company wide social network called CompNet. Each user in Complet is given a unique number f CompNet numbered from 1 to N. Here are the specifications of Compet-In CompNet, i th user can make th user his friend without becomingas in Facebook.Ith user can make th user his friend only ifhis friend himself, ie in Compet,• Also one user should have no more and no less than one friend except user 1 who will have no friendLisa wants to find out whether one user is somehow linked to some other user Help Lisa do soInput:Each test case has 2 input lines.The first line of each test case takes the number of users, N. The second line of each test case consists of N 1 friend of (i+1)th userOutput:Print all possible connections starting from user 2 to user N with other users starting from 1 to The Cument User Number another user, that connection sho

Answer 1

Answer:

hakaushwjaisjwkaushsksiehenskisz