Design an O(n2)-time algorithm that takes as input the list of n people and the list of m pairs who know each other and outputs the best choice of party invitees (the guest list which meets the constraints and has maximum size). You may assume you have hashing functionality whenever needed and that n = O(m) and m = o(n2).

the omega button is one of them.

solution:

the right option is a

to adding   a new row to a table we   have to do process last table cell and pressing tab.

this is the process to add new row in the cell:

* to add a row below the cell, click insert below in the rows and columns group.

thus this is the required right answer.

answerenforce the organization's security policy;