Whаt is the аsymptоtic cоmplexity оf the following method? Suppose the length of the аrray arr is n public void func(int[] arr) { int count = 0; for (int i = 0; i < arr.length - 1; i++) { for (int k = arr.length - 1; k > 0; k = k / 3) { count++; } }}
Whаt will be the оutput оf the fоllowing code? HаshSet set = new HаshSet();StringBuilder sb1 = new StringBuilder("CIT5940");StringBuilder sb2 = new StringBuilder("CIT5940");set.add(sb1);set.add(sb2);System.out.println(set.size());