Question $1$

How to Attempt?

Good Subsequence

Given a sequence of $N$ elements. Your task is to find sums of all good

subsequences and return the maximum sum among them.

A subsequence is said to be a Good Subsequence if: $-$

It contains exactly $\frac{N}{2}$ elements.

It does not contain any two adjacent elements from the given

sequence

Note: As the answer may be large so return answer modulo with ${10}^9+7.$

Input Specification:

input$1$ : An integer value $N$ representing the number of elements

in a sequence.

input$2$: An integer array representing the elements present in the

given sequence.

Output Specification:

solve it in c$++$