Let `f:N->N` be defined as `f(n)= (n+1)/2` if n is odd and `f(n)=n/2` if n is even for all n`in`N State whether the function f is bijective. Justify your answer

Let f: N to N be defined as f(n) = (n+1)/(2) when n is odd and f(n) = (n)/(2) when n is even for all n in N . State whether the function f is bijective. Justify your answer.

Let f : N->N be defined by f(n)={(n+1)/2,"if n is odd " n/2,"if n is even " for all n in N . State whether the function f is bijective. Justify your answer.

Let f: N to N be defined by f(n) = { (((n+1)/2)if n is odd), (n/2 if n is even) :} for all n in N State whether the function f is bijective. Justify yur answer.

Let f:NrarrN be defined by, f(n) = {((n+1)/2,,if n is odd,,),(n/2,,if n is even,,):} for all n in N . State whether the function f is bijective. Justify your answer.

Let : f: N rarr N be defined by f(n)={{:((n+1)/2," if n is odd"),(n/2," if n is even"):} for all n inN . State whether the function f is bijective . Justify your answer.

Let f: N to N be defined by f (n) = {{:((n +1)/( 2 ), if n " is odd" ), ( (n)/(2), "if n is even "):} for all n in N. State whether the function f is bijective. Justify your answer.

Let f: N to N be defined by f(n) = {{:((n+1)/2, " if n is odd "),(n/2, " if n is even "):} for all n in N . State whether the function f is bijective.