VISIT TO FETESimran goes to a fete in Mumbai. There was an interesting game of cards . A boxcontaining cards numbered from 1 to 200 was placed on a table. A person has toselect a card a card at random. Exciting prizes were awaiting for the winner;but with conditions !!!·       Wall clock – If thenumber on the selected card is a perfect square·       Power bank – If thenumber on the selected card is a multiple of 3·       Puppet – If the numberon the selected card is divisible by 10·       Water bottle – If thenumber on the selected card is a Prime number more than 100 but less than 150·       Better luck next time –If the number on the selected card is a perfect cubeOn the basis of theabove information , answer these questions9. The Probability of winning a water bottle is1 pointOption 1Option 2Option 3Option 410. The Probability of winning a Power bank is1 pointOption 1Option 2Option 3Option 411. The Probability of winning a Wall clock is1 pointOption 1Option 2Option 3Option 412. The Probability of getting ‘Better Luck Next Time’ is 1 pointOption 1Option 2Option 3Option 4

Hari takes a card from a deck which has got only two-digit numbers. The card he picked has got a number which can be obtained either by multiplying the digit sum by 8 and adding 1 to it or by multiplying the difference of digits by 13 and adding 2 to it. The number Hari got is ____.Marks : 2Negative Marks : 0Answer here54522541

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

In a card game, the dealer distributes one card to each player. Each player then bets an amount on his card without looking at his card. After betting, the player shows his card. If the card is an ace, the dealer pays the player five times his bet. If the card is a king, the dealer pays the player four times his bet. If the card is a queen, the dealer pays the player three times the bet. If the card is any other card, the player has to forfeit his bet. If Mr. Crap Baggins is joining the game with Rs. 13000, how much money can he hope to have, when he leaves the game?Choices:- 14000 12000 13860 15540

Fred has the cards below:6       7       8       9       10       11      Select the letter that matches the probability of selecting a card with a number which is between 6 and 11.ABCDEFG01xya2ab789÷funcs()<>456×|a|,≤≥123−ABCπ0.=+ A B C D E F G

Use the following experiment. A state lottery game consists of choosing one card from each of the four suits in a standard deck of playing cards. (There are 13 cards in each suit.)Count the number of ways in which four 2's can be chosen.