In each of 7 and 8, let 0(t) = 0 and use the method of successive approximations tosolve the given initial value problem.(a) Determine n(t) for an arbitrary value of n.(b) Plot n(t) for n = 1, ... , 4. Observe whether the iterates appear to be converging.(c) Show that the sequence {n(t)} converges.y= t2y t, y(0) = 0

$1lotl,k Math 1301 Logic: Simple Statements and Negations Obiectives lnterpreand expresssimple statementin symbolicform. Expressnegationsof statements. lnterpreand expresscompound statementsin symbolicorm using connectors. Statement: has a truthvalue Texas isthe largeststate.(p) F (q) Oklahoma borders Texas. 1 Negation: (-) state.(^p 1,.Texas is nr*the largest )T 2. Oklahoma c\urrr\ border Texas.(^ .1)tr Watch quantifiers,(all,none, some) especiallywhen negating. All fishcan fly.(f) .\s\^ Lov"rnu\ t\v\ (-f) Sovn( Some fishcan fly.s) (-s) No tttvr Cu\n