To simulate this random walking mo$$on for N steps, we can create a computer

program. This program should ask the user to input an integer represen$$ng the

number of steps to be taken. It should work for any posi$$ve value of steps, even

for a large number. However, if the user enters an invalid number $($such as a

nega$$ve value$),$ the program should display an error message. A$$er each step, the

program should show the current loca$$on of the random walker with respect to

the origin $($lamp post$).$ Finally, when the random walker has completed all the steps,

the program should calculate and display the squared distance from the origin,

which is determined by the formula $($x$2+$ y$2$

$).$ You should use Switch statement to

solve this problem.