What is the output when this java code is run:

import java.util.$*$;

public class LabQuiz$1\{$

@SuppressWarnings$("$unchecked$")$

public static void main$($String$[]$ args$)\{$

$//$ A stack is given with the following inputs

Stack stack $=$ new Stack$<>()$;

Random r $=$ new Random$()$;

int max $=100$;

int min $=1$;

for $($int i $=0$; i $<30$; i$++)\{$

stack.push$($r$.$nextInt$(($max $-$ min$)+1)+$ min$)$;

$\}$

System.out.println$("$your origin stack"$)$;

System.out.println$($stack $+"$ size is: $"+$ stack.capacity$())$;

Stack mystack$1=($Stack$)$ stack.clone$()$;

Stack mystack$2=($Stack$)$ stack.clone$()$;

Stack mystack$3=($Stack$)$ stack.clone$()$;

System.out.println$("$Sorted Stack"$)$;

System.out.println$($sortedStack$($mystack$1))$;

$//$ write a program to calculate the frequency of your stack with hashmap.

System.out.println$("$print out the results for your hashmap"$)$;

count$($mystack$2).$forEach$(($key$,$ value$)->$ System.out.println$($key $+""+$ value$))$;

$//$ write a program to put your stack into a hashset.

System.out.println$("$Print out the results for your hashset"$)$;

HashSet hset $=$ stackTohashSet$($mystack$3)$;

System.out.println$($hset $+"$ size is: $"+$ hset.size$())$;

$\}$

public static Stack sortedStack$($Stack stack$)\{$

Stack sortedStack $=$ new Stack$<>()$;

while $(!$stack.isEmpty$())\{$

int temp $=$ stack.pop$()$;

while $(!$sortedStack.isEmpty$()$ && sortedStack.peek$()>$ temp$)\{$

stack.push$($sortedStack$.$pop$())$;

$\}$

sortedStack.push$($temp$)$;

$\}$

return sortedStack;

$\}$

public static HashMap count$($Stack stack$)\{$

HashMap hmap $=$ new HashMap$<>()$;

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

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

$\}$

return hmap;

$\}$

public static HashSet stackTohashSet$($Stack stack$)\{$

return new HashSet$<>($stack$)$;

$\}$

$\}$