Question: Please do number 4 in MATLAB code, thankyou! ru) sin(or) 3. Ellipse. Write a program, plotellipse.m, that animates the plotting of the following parametrically defined
Please do number 4 in MATLAB code, thankyou!

ru) sin(or) 3. Ellipse. Write a program, plotellipse.m, that animates the plotting of the following parametrically defined motion characterized by T and ? xrcos(ot) y r sin(wt + ?) 4. Lissajous. Write a program, plotLJ.m, that plots the following parametrically defined motion characterized by T, a, b, and ?. xrcos(awt) Add the option to animate the motion (animateoN-true or false) in a second figure (see help figure in the Command window) after pausing 2 seconds to see the complete graph. 5. Random walk in one dimension. Write a program, rwld.m, that generates and plots random walks in one dimension. Let the walker start at x 0 and move a unit step to the right or left, depending on a random number generated with r-rand. If r 0.5, the walker steps one unit to the left. Its position after each step depends on the previous position and the value of r. The key data structure is an array x. Let x(istep) be the position of the walker after Cistep-1) steps. Initialize the x array to N zeros (start with N 100 and let it get ru) sin(or) 3. Ellipse. Write a program, plotellipse.m, that animates the plotting of the following parametrically defined motion characterized by T and ? xrcos(ot) y r sin(wt + ?) 4. Lissajous. Write a program, plotLJ.m, that plots the following parametrically defined motion characterized by T, a, b, and ?. xrcos(awt) Add the option to animate the motion (animateoN-true or false) in a second figure (see help figure in the Command window) after pausing 2 seconds to see the complete graph. 5. Random walk in one dimension. Write a program, rwld.m, that generates and plots random walks in one dimension. Let the walker start at x 0 and move a unit step to the right or left, depending on a random number generated with r-rand. If r 0.5, the walker steps one unit to the left. Its position after each step depends on the previous position and the value of r. The key data structure is an array x. Let x(istep) be the position of the walker after Cistep-1) steps. Initialize the x array to N zeros (start with N 100 and let it get
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
