Let `f: A -> B and g : B -> C` be two functions and `gof: A -> C` is define statement(s) is true?

If f: A-> B and g: B-> C be the bijective function, then (gof)^(-1) is:

Show that if f : A ->B and g : B ->C are onto, then gof : A ->C is also onto.

Let f : A to B and g : B to C be the bijective functions. Then (g of )^(-1) is

Let f : A rarr B and g : B rarr C be onto functions, show that gof is an onto function.

Let f: A rarr B and g : B rarr C be the bijective funtions. Then (gof)^-1 is

Show that if f : A ->B and g : B ->C are one-one, then gof : A ->C is also one-one.

Let f: A to B and g: B to C be two functions. Then; if gof is onto then g is onto; if gof is one one then f is one-one and if gof is onto and g is one one then f is onto and if gof is one one and f is onto then g is one one.

Let f: A to B and g: B to C be two functions. Then; if gof is onto then g is onto; if gof is one one then f is one-one and if gof is onto and g is one one then f is onto and if gof is one one and f is onto then g is one one.

If f: A->B and g: B->C are onto functions, show that gof is an onto function.