Suppose L is a list of integers. Return the longest contiguous subsequence in L whose elements are strictly increasing. If there are multiple longest contiguous subsequences, return the first one from left to right. Example 1: L=[1,3,2,4,6,5,7]. You should return Linc= [2,4,6]. Example 2: L=[1,1,0,−1,0,1,1]. You should return Linc= [−1,0,1]. def longest_increasing_subseq(L): return Linc
