input . If n> 0, output .

Start with S= 0. if S= S+ 1.2. describe an algorithm that takes as input a list of n integers and finds the number of negative integers in the list.

Start with X= -100000000 (or something you know is less than any integer in the list). Input . If [tex]a_n[tex] is even, compare to X. If X< . Replace S by X. After finishing the list, output X3. describe an algorithm that takes as input a list of n distinct integers and finds the location of the largest even integer in the list or returns 0 if there are no even integers in the list.