Create max_sum_in_sub_seq.py

1. Given an array of positive numbers, find the maximum sum of a subsequence with the constraint that 
no 2 numbers in the sequence should be adjacent in the array. (extended to negative numbers)