[" (5) Let "f:N rarr N" be a function defined by "],[f(n)={[n+1," if "n" is odd "],[n-1," if "n" is even "]],[" show that "f" is bijective."]

Let f: N->N be defined0 by: f(n)={(n+1)/2, if n is odd (n-1)/2, if n is even Show that f is a bijection.

Let f:N rarr N be defined by: f(n)={n+1,quad if n is oddn -1,quad if n is even Show that f is a bijection.

Let f: N rarr N be defined by : f(n)= {(n+1, if n is odd),(n-1, if n is even):} .Show that f is a bijective function.

Let f: N rarr N be defined by : f(n) = {:{((n+1)/2, if n is odd),(n/2, if n is even):} then f is

Let f : N rarr N be defined by f(n) = {{:((n+1)/(2), if "n is odd"),((n)/(2),"if n is even"):} Show that f is many one and onto function.

Let f:N rarr N defined by f(n)={{:((n+1)/(2) " if n is odd"),(n/2" if n is even"):} then f is

Let f:NtoN defined by : f(n)={:{((n+1)/(2) "if n is odd"),((n)/(2) "if n is even"):}

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.