Let `n(A)=5` and `n(B)=3` then find the number of injective functions and onto functions from `A ` to `B`

Explanation

To solve the problem of finding the number of injective and onto functions from set A to set B, we follow these steps:

### Step 1: Understanding Injective Functions
An injective function (or one-to-one function) from set A to set B requires that every element in A maps to a unique element in B. This means that the number of elements in set B must be greater than or equal to the number of elements in set A.

Given:
- \( n(A) = 5 \)
- \( n(B) = 3 \)
...