# /*
#
# Find an efficient algorithm to find maximum sum of a subsequence in an array such that no consecutive elements are part of this subsequence.
# Consider the following examples, the max sums of subsequence with no consecutive elements in
#
#
# Input : arr[] = {5, 5, 10, 100, 10, 5}
# Output : 110        *       *       *
#
# Input : arr[] = {1, 2, 3}
# Output : 4
#
# Input : arr[] = {1, 20, 3}
# Output : 20
#
# */
#
