Suppose L is a list of integers. Return the longest contiguous subsequence in L whose elements are strictly increasing. Assuming that there are no multiple longest contiguous subsequences.

a) The task is not achievable.
b) A single longest contiguous subsequence is guaranteed.
c) There can be multiple longest contiguous subsequences.
d) The output depends on the specific list of integers.