Given the underneath fragment code that is written in C , write down the function with domain and codomain then prove that function is bijective one to one and onto

unsigned int f(unsigned int n ) {

return (int) (1-(pow(-1,n)+2*n))/4

}