Evaluate the time complexity of the following code snippets. Evaluate line by line, create a time complexity function and then define its Big O value.

function getXOR$($arr$1,$ arr$2)\{$

arr$3=[]$

for $($i $=0$; i $<$ arr$1.$length; i$++)\{$

let unique $=$ True

for $($j $=0$; j $<$ arr$2.$length; j$++\}\{$

if$($arr$1[$i$]==$ arr$2[$j$])\{$unique $=$ False;$\}$

$\}$

if $($unique$)\{$arr$3.$append$($arr$1[$i$])$;$\}$

$\}$

$\}$

for $($i $=0$; i $<$ arr$2.$length; i$++)\{$

let unique $=$ True

for $($j $=0$; j $<$ arr$1.$length; j$++\}\{$

if$($arr$2[$i$]==$ arr$1[$j$])\{$unique $=$ False;$\}$

$\}$

if $($unique$)\{$arr$3.$append$($arr$2[$i$])$;$\}$

$\}$

return arr$[3]$

$\}$