A(n) loop allows you to cycle through an array without specifying the starting and ending points for the loop

Write a method named addall that could be placed inside the hashintset class. this method accepts another hashintset as a parameter and adds all elements from that set into the current set, if they are not already present. for example, if a set s1 contains [1, 2, 3] and another set s2 contains [1, 7, 3, 9], the call of s1.addall(s2); would change s1 to store [1, 2, 3, 7, 9] in some order. you are allowed to call methods on your set and/or the other set. do not modify the set passed in. this method should run in o(n) time where n is the number of elements in the parameter set passed in.

Q-1 which of the following can exist as cloud-based it resources? a. physical serverb. virtual serverc. software programd. network device

If i wanted to include a built-in calendar in a document, what option could i select? draw table insert table insert chart quick tables