By [n][n] we denote the set {1,…,n}. a function f: [m]→[n] is called monotone if f(i) \leq f(j)f(i)≤f(j)whenever i < ji

There are a total of   functions.

Step-by-step explanation:

In order to define an injective monotone function from [3] to [6] we need to select 3 different values fromm {1,2,3,4,5,6} and assign the smallest one of them to 1, asign the intermediate value to 2 and the largest value to 3. That way the function is monotone and it satisfies what the problem asks.

The total way of selecting injective monotone functions is, therefore, the total amount of ways to pick 3 elements from a set of 6. That number is the combinatorial number of 6 with 3, in other words

i really dont know

step-by-step explanation:

a is the right answer