Are f and g both necessarily onto, if `gof` is onto?

Are fand g both necessarily onto, if gof is onto?

Consider functions f and g such that composite gof is defined and is one one Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is one-one.Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is oneone. Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is one one Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is one-one.Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is one one Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is one one Are f and g both necessarily one-one.

Consider functions f and g such that composite gof is defined and is one-one. Are f and g both necessarily one-one.

Let f: A -> B and g : B -> C be two functions and gof: A -> C is define statement(s) is true? a. If gof is one-one, then f anf g both are one-one b. if gof is one-one, then f is one-one c. If gof is a bijection, then f is one-one and g is onto d. If f and g are both one-one, then gof is one-one.