human
Shortest Common Supersequence | A Naive recursive python program to find length of the shortest supersequence.
Driver Code"
Solution in Python:

=====
Can you provide a code to shortest Common Supersequence and the other steps required?
assistant
#Here is code to shortest Common Supersequence and the other steps required.
 def superSeq ( X , Y , m , n ) :
	if ( not m ) :
		return n
	if ( not n ) :
		return m
	if ( X [ m - 1 ] == Y [ n - 1 ] ) :
		return 1 + superSeq ( X , Y , m - 1 , n - 1 )
	return 1 + min ( superSeq ( X , Y , m - 1 , n ) , superSeq ( X , Y , m , n - 1 ) )
X = " AGGTAB "
Y = " GXTXAYB "
print ( " Length ▁ of ▁ the ▁ shortest ▁ supersequence ▁ is ▁ % d " % superSeq ( X , Y , len ( X ) , len ( Y ) ) )