For each item, identify the way it is usually addressed in the software industry. Applying a bug fix: Addressing a security flaw: Improving ease of use: Adding new features:

Which of these serves as a bridge between the programming team and the audio team?

Question 1 excel is a tool used to a create a spreadsheet b design a brochure c make a presentation d write a letter question 2 a cell on an excel spreadsheet refers to a a type of document view b a page of the workbook c the rectangular box where a column and row intersect d the data in a worksheet question 3 tanya is entering the amount of money she has earned from babysitting onto an excel spreadsheet, but the autocomplete feature is not working. why? a autocomplete must be turned on before every entry. b autocomplete only works with professional spreadsheets. c autocomplete does not recognize types of currency. d autocomplete only works when the first character is text. question 4 which tab has formatting features to change the font style, color, size, and alignment? a file b home c insert d view question 5 brad uses excel to create a weekly schedule. he wants to keep using the same spreadsheet every year. one of his rows is titled "baseball," but the season has ended until next year. what is the most efficient way to modify the spreadsheet, so brad does not see baseball on his schedule but can easily get it back when the season starts again? a add a new comment with the start date of the next season b hide the row and unhide it when the new season begins c highlight the row in a different color to show the season has ended d start a new spreadsheet

In this problem, we want to determine a set of states with the smallest total population that achieves an electoral college win. specifically, for each state i, for i = 1, 2, . . , n, let pi be its population and vi its electoral votes. all electoral votes of a state go a single candidate, and so the (overall) winning candidate is the one who receives at least v = b( p i vi)/2c + 1 electoral votes. our goal is to find the set of states s for which p i∈s pi is as small as possible subject to the constraint that p i∈s vi ≥ v . design a dynamic programming algorithm for this problem; prove its correctness; and analyze its time complexity.