How to count all increasing subsequenecs?

general
1

I am new at dynamic programming. I face a question - how to count all increasing subsequenecs?
Please help me to solve this.