Implement the Function invert$($x$,$ p$,$ n$)$

Requirements:

Write a function unsigned int invert$($unsigned int x$,$ int p$,$ int n$)$ that returns x with the n

bits that begin at position p inverted $($changing $1$ to $0$ and $0$ to $1),$ leaving the other bits

unchanged.

Bits are numbered from $0($least significant bit$)$ to $31($most significant bit$).$

Position p specifies the starting bit position $($with $0$ being the rightmost bit$).$

Use standard bitwise operators $($ & $,|,^,$ ~ $,<<,>>)$ to manipulate bits.

Test Cases:

$1.$ Input:

x $=45($binary $00101101)$

p $=4$

n $=3$

Expected Output: $49($binary $00110001)$

Explanation: Inverting $3$ bits starting at position $4$ changes bits $011$ to $110.$

$2.$ Input:

x $=240($binary $11110000)$

p $=7$

n $=4$

Expected Output: $0($binary $00000000)$

Explanation: Inverting $4$ bits starting at position $7$ changes bits $1111$ to $0000.$

Additional Test Case: $($Output hidden$)$

Input:

x $=170($binary $10101010)$

p $=5$

n $=4$