1) Given the list of integers 1, -2, 3, -6, 7, -8, 9, 10, -11,
indexed from 1 to 9, the left-to-right linear scan algorithm (O(n)
algorithm) will set as candidate start positions for a maximum
contiguous sequence the elements at the index positions:
(a) 1,3,4,6
(b) 1,3,4,6,9
(c) 1,3,5,7
(d) none of the above
2)The Fibonacci sequence 1,1,2,3, ... can be generated
iteratively by starting with the first two (0th and 1st) and
generating every subsequent one by adding...