GATE Questions

---

Let 'Y' be the youngest player.

The last song can be sung by any of the remaining 3 players. The first 3 players can sing the song in (3!) ways.

The required number of ways = 3(3!) = 4320.

Given letters are k, l, m, n, o = 5

number of letters to be in the words = 3

Total number of words that can be formed from these 5 letters taken 3 at a time without repetation of letters = 5P3 ways.

⇒ 5P3 = 5 x 4 x 3 = 60 words.

From the given data,

1 + 9 + 8 = 1

ONE + NINE + EIGHT

Consider the first letters and join them viz O N E = 1

So, now consider 2 + 8 + 9 in similar way

TWO+EIGHT+NINE

First letters are T E N = 10

2 + 8 + 9 = 1⃣0⃣