Given - Very Simple Programming Language (VSPL) := a b c ... | 2 | | 1 | ... | 9 ::- + | - * |||* | | == | >= | :: = | :: | 1 ( ) ::= = ; :: | Identify each valid statement (multiple answer): a = x+y; b=s*tc=w+v: dvalue = (a*a) +(2*a*b)+(b*b): average = Total / Length: (x2-x1) = vel/(t2-1): newval = (((a*b) + c) / d): accel a distance / time 2: Given the following Backus Naur Form: : 1121314151617181910 ::= | ::= a b c ... | 2 ::= ::= | | :: | = | = | != : + | - | */% :: 1 && ** ! ":= | | := | |( ) ::= = cexpression> ::= | ::= IF THEN [ELSE ] Identify all the valid code samples: Note: things in [] means optional IF ab^C THEN one-is-true = 1; none-is-true = 0: ELSE one-is-true = 0; none-is-true = 1; IF min1