Find out the time and space complexity for the following two functions:

def print$\_$distinct$\_$pairs$($l$)$:

for i in range$($len$($l$))$:

for j in range$($i$+1,$ len$($l$))$:

if l$[$i$]!=$ l$[$j$]$:

print$($f$"\{$l$[$i$]\}\{$l$[$j$]\}")$

def blah$($l$)$:

for i in range$($len$($l$))$:

result $=[]$

for j in range$($len$($l$))$:

for k in range$($len$($l$))$:

result.append$($l$[$i$]+$ l$[$j$]-$ l$[$k$])$

return result