Please use Mathlab or Scilab to write code. using this Pseudocode: // Euler's Method: to approxim... Please use Mathlab or Scilab to write code. using this Pseudocode: // Euler's Method: to approximate the solution y'=f(t,y), a<=t<=b, y(a)=alpha

// we will use N+1 equally spaced numbers in the interval [a,b]

// INPUT: endpoints a, b; integer N, initial condition alpha

// OUTPUT: approximate solution w to y at the (N+1) values of t

// STEP 1: Set h=(b-a)/N; // t = a; // w = alpha

// STEP 2: For i = 1,2,..N do STEPS 3-4

// STEP 3: Set w = w+hf(t,w); // t = a+ih

// STEP 4: OUTPUT (t,w) // STEP 5: STOP

// NOTE: Solve y'=te^(3t)-2y, 0<=t<=1, y(0)=0, N=10, NOTE: You must find y(t) Built a flowchart and a algorithm to solve Euler Method and Runge-Kutta to Solve:r y'=te^(3t)-2y, 0<=t<=1, y(0)=0, N=10. you must plot y(t) the solution and make a chart with solutions in CVS file. Algorithm must have the Euler and Runge-Kutta code in them. Show the output to show time, Real solution, Euler Approx., Error in Euler, ODE Approx., and ODE error in spreed sheet.