Write a method called fillGaps that accepts a PriorityQueue of integers as a parameter and adds elements to it until every element in its range of smallest to largest is represented once if it was not previously found in the priority queue. For example, if the queue stores [1, 3, 3, 6, 6, 8], your method should modify the queue to store [1, 2, 3, 3, 4, 5, 6, 6, 7, 8]. You may use one collection as auxiliary storage.

Which of the following commands is more recommended while creating a bot?

Write a program that keeps asking the user for new values to be added to a list until the user enters 'exit' ('exit' should not be added to the list). these values entered by the user are added to a list we call 'initial_list'. then write a function that takes this initial_list as input and returns another list with 3 copies of every value in the initial_list. finally, inside print out all of the values in the new list. for example: input: enter value to be added to list: a enter value to be added to list: b enter value to be added to list: c enter value to be added to list: exit output: a b c a b c a b c note how 'exit' is not added to the list. also, your program needs to be able to handle any variation of 'exit' such as 'exit', 'exit' etc. and treat them all as 'exit'.

An npn transistor is correctly biased and turned on if the a. base is negative. b. collector is negative. c. collector is positive with respect to the emitter and negative with respect to the base. d. collector is the most positive lead followed by the base.