Hi Ron,

For an onto function, every element in b in B must have an element a in A such that f(a)=b. **condition (i)**

thus total # of functions possible= 2^4=16.

this includes those functions as well where one or more elements from set B are excluded

say for all a in A, f(a)=p or f(a)=r, thus violating **condition (i)** for onto fn.

thus we need to take of these 2 cases.

thus total # of onto fns = 16-2=14.

"Woh mara papad wale ko!"