If an operation can be performed in \(x\) number of ways, and another operation can be performed in \(y\) ways, and both of the operations are not independent (depended on each other) then the two operations can be executed in \(x\times y\) ways.

Ravi bought \(3\) shirts, \(3\) pants, and \(2\) shoes to wear for the upcoming festival. He cannot wear them individually. So can you find what the possible ways to dress these clothes are?

Since the operation here is dependent, we should multiply the given variants.

The total possible ways \(=\) The number of shirts he bought \(×\) The number of pants he bought \(×\) The number of shoes he bought.

\(=\) \(3 × 3 ×2 = 18\).

Therefore, Ravi has \(18\) possible ways to wear bought dresses.

Applying this multiplication principle, we can find the total possible way for the operation which is dependent on each other.