Three friends, Syam, Samanta and Siri have a set of 6 algebraic cards as shown below, on a table. Each card has an algebraic expression written on it. Here, ‘x’ is an integer. Each person has to pick up two cards, alternatively

Three friends, Syam, Samanta and Siri have a set of 6 algebraic cards as shown below, on a table. Each card has an algebraic expression written on it. Here, ‘x’ is an integer. Each person has to pick up two cards, alternatively.Your answerQ.1 Samanta picked up cards with numbers 3 and 5. If she imagined x = 2, then what is the total value of her cards.1 point46-101331

The remaining cards are picked up by the left over person. She wants to make her cards values, equal to each other. Then which value of ‘x’ will make her cards equal?

f everybody imagined ‘x’ value as zero, then what is the total value of these six cards?

Satya Prakash has some 'N' amount of blank cards of heart-shaped. Each of the other cards is hanging on to exactly one other card by a piece of string, whereas Card 1 is affixed to the wall directly. Specifically, card i (i>1) is hanging onto card p[i] , p[i] is smaller than i.During the Initial time, Satya Prakash must write one integer number on each card. He does this by choosing any permutation a of [1,2,…,n]. Then, the number written on card i is a[i].After that, Satya Prakash must do the following operation n times while maintaining a sequence s (which is initially empty):Choose a card x such that no other cards are hanging onto it.Append the number written on card x to the end of s.If x≠1 and the number on card px is larger than the number on card x, replace the number on card px with the number on card x.Remove card x.After that, Satya Prakash will have a sequence s with n elements. What is the maximum length of the longest non-decreasing subsequence† of s at the end if Satya Prakash does all the steps optimally?Input FormatThe first line contains a single integer n — the number of cards.The second line contains n−1 integers p2,p3,…,pn describing which card that each card hangs onto.Constraints2≤n≤10^51 ≤ p[i] < iOutput FormatPrint a single integer — the maximum length of the longest non-decreasing subsequence of s at the end if Satya Prakash does all the steps optimally.Sample Input 081 1 1 2 3 1 4Sample Output 07Sample Input 171 2 2 4 5 1Sample Output 15

At a card party, someone brings out a deck of bridge cards (4 suits with 13 cards in each). N people each pick 2 cards from the deck and hold onto them. What is the minimum value of N that guarantees at least 2 people have the same combination of suits?