human
Count of Subsets of a given Set with element X present in it | Python3 code to implement the above approach.
N stores total number of subsets.
Generate each subset one by one.
Check every bit of i.
if j 'th bit of i is set,  check arr[j] with X.
Driver code"
Solution in Python:

=====
Write me a code to count of Subsets of a given Set with element X present in it and the other steps required?
assistant
#Here is code to count of Subsets of a given Set with element X present in it and the other steps required.
 def CountSubSet ( arr , n , X ) :
	N = 2 ** n ;
	count = 0 ;
	for i in range ( N ) :
		for j in range ( n ) :
			if ( i & ( 1 << j ) ) :
				if ( arr [ j ] == X ) :
					count += 1 ;
	return count ;
if __name__ == " _ _ main _ _ " :
	arr = [ 4 , 5 , 6 , 7 ] ;
	X = 5 ;
	n = len ( arr ) ;
	print ( CountSubSet ( arr , n , X ) ) ;