consider two vectors that are not sorted, each containing n comparable items. how long would it take to display all items (in any order) which appear in either the first or second vector, but not in both, if you are only allowed θ(1) additional memory? give the worst-case time complexity of the most efficient algorithm.

Which scenario describes intraspecific, indirect competition? a. a peacock defends its territory against another peacock. b. lions and hyenas compete for the same prey animals. c. a male black bear eats fish in an area of a lake, so other black bears can’t. d. different species of birds fight over spilled popcorn on the ground.