What is the time complexity of this following code segments:

void printUnorderedPairs$($int $[]$ arrayA, int $[]$ arrayB$)\{$

for $($int $i=0$;$i$ arrayA. length; $i++)\{$

for $($int $j=0$;$j$ arrayB. length; $j++)\{$

for $($int $k=0$;$k<mn\; id="EditorElement\_3952306">1</mn><mn\; id="EditorElement\_3952307">0</mn><mn\; id="EditorElement\_3952308">0</mn><mn\; id="EditorElement\_3952309">0</mn><mn\; id="EditorElement\_3952310">0</mn><mn\; id="EditorElement\_3952311">0</mn>$;$k++)\{$

System.out.println$($array$[$i$]+","+$ array$[$j$]$;

$\}$

$\}$

$\}$

$\}$

Select one:

a$.O(n)$

b$.O(n^2)$

c$.O(logn)$

d$.O(n**m)$

e$.O(n^3)$