MATLAB question Please write the mfile with using Trapezoida

MATLAB question.

Please write the m-file with using Trapezoidal rule and Simpsons rule.

There are similar sample problem and its solution provided. But there is no m-file about in the solution.

Please write the m-file about my question.

Thanks!

<My Question>

<Sample problem and its solution>

hwy 9.4 Integration provides a means to compute how much mass enters or leaves a reactor over (30 Points) a specified time period, as in t2 t1 where t and t2 are initial and final times, respectively. This formula makes intuitive sense if you recall the analogy between integration and summation. Thus, the integral represents the summation of the product of flow times concentration to give the total mass entering or leaving from ti to tz. Use numerical integration to evaluate this equation for the data listed below: t, min 0 10 20 30 35 40 45 50 2, m3/min 4 4.8 5.2 5.0 4.6 4.3 4.3 5.0 c, mg/m3 10 35 55 52 40 37 32 34 Use any method and software you wish.

Solution

A settled finite automaton M may be a 5-tuple, (Q, , , q0, F), consisting of

a finite set of states (Q)
a finite set of input symbols referred to as the alphabet ()
a transition operate ( : letter of the alphabet × Q)
an initial or begin state (q0 Q)
a set of settle for states (F Q)
Let w = a1a2 ... Associate in Nursing be a string over the alphabet . The automaton M accepts the string w if a sequence of states, r0,r1, ..., rn, exists in letter of the alphabet with the subsequent conditions:

r0 = q0
ri+1 = (ri, ai+1), for i = 0, ..., n1
rn F.
In words, the primary condition says that the machine begins within the start state q0. The second condition says that given every character of string w, the machine can transition from state to state in keeping with the transition operate . The last condition says that the machine accepts w if the last input of w causes the machine to halt in one in all the acceptive states. Otherwise, it\'s same that the automaton rejects the string. The set of strings that M accepts is that the language recognized by M and this language is denoted by L(M).

A settled finite automaton while not settle for states and while not a beginning state is understood as a transition system or semiautomaton.

For a lot of comprehensive introduction of the formal definition see automata theory.