human
Count all increasing subsequences | Function To Count all the sub - sequences possible in which digit is greater than all previous digits arr [ ] is array of n digits.
count [ ] array is used to store all sub - sequences possible using that digit count [ ] array covers all the digit from 0 to 9.
scan each digit in arr [ ].
count all possible sub - sequences by the digits less than arr [ i ] digit.
store sum of all sub - sequences plus 1 in count [ ] array.
Now sum up the all sequences possible in count [ ] array.
Driver Code"
Solution in Python:

=====
What is a code to count all increasing subsequences and the other steps required?
assistant
#Here is code to count all increasing subsequences and the other steps required.
 def countSub ( arr , n ) :
	count = [ 0 for i in range ( 10 ) ]
	for i in range ( n ) :
		for j in range ( arr [ i ] - 1 , - 1 , - 1 ) :
			count [ arr [ i ] ] += count [ j ]
		count [ arr [ i ] ] += 1
	result = 0
	for i in range ( 10 ) :
		result += count [ i ]
	return result
arr = [ 3 , 2 , 4 , 5 , 4 ]
n = len ( arr )
print ( countSub ( arr , n ) )