human
Shortest Common Supersequence | Returns length of the shortest supersequence of X and Y.
Fill table in bottom up manner.
Below steps follow above recurrence.
Driver Code"
Solution in Python:

=====
Give me 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 ) :
	dp = [ [ 0 ] * ( n + 2 ) for i in range ( m + 2 ) ]
	for i in range ( m + 1 ) :
		for j in range ( n + 1 ) :
			if ( not i ) :
				dp [ i ] [ j ] = j
			elif ( not j ) :
				dp [ i ] [ j ] = i
			elif ( X [ i - 1 ] == Y [ j - 1 ] ) :
				dp [ i ] [ j ] = 1 + dp [ i - 1 ] [ j - 1 ]
			else :
				dp [ i ] [ j ] = 1 + min ( dp [ i - 1 ] [ j ] , dp [ i ] [ j - 1 ] )
	return dp [ m ] [ n ]
X = " AGGTAB "
Y = " GXTXAYB "
print ( " Length ▁ of ▁ the ▁ shortest ▁ supersequence ▁ is ▁ % d " % superSeq ( X , Y , len ( X ) , len ( Y ) ) )