What is the time complexity and asymptotic upper bound of the brute-force pseudo code?

function find_max_subsequence(X, Y):

max_subseq = []

for sx in all_subsequences(X):

for sy in all_subsequences(Y):

if sx == sy and len(sx) > len(max_subseq):

max_subseq = sx

return max_subseq