import java.util. HashMap;

import java.util. Map;

public class CountOccurrences $\{$

public static Map countOccurrences$($int$[]$ arr$)\{$

Map occurrences $=$ new HashMap$<>()$;

for $($int num : arr$)\{$

occurrences. put $($num$,$ occurrences.getOrDefault $($num$,0)+1)$;

$\}$

return occurrences,

$\}$

$\}$

What is the time complexity of this algorithm $?$