1. Apply the bottom-up dynamic programming algorithm to the following instance of the knapsack problem: Item Weight Value 1 3 $25 2 2 $20 3 $5 4 $40 5 $45 Capacity W = 10. 26 6 4 5

What type of situation requires using a subquery?

Where do domain restrictions begin and end?

Please use following table information to answer the exercises.SQL> DESC DEPARTMENTSName Null? Type----------------------------------------- -------- ----------------------------DEPARTMENT_ID NOT NULL NUMBER(4)DEPARTMENT_NAME NOT NULL VARCHAR2(30)MANAGER_ID NUMBER(6)LOCATION_ID NUMBER(4)     SQL> DESC EMPLOYEESName Null? Type----------------------------------------- -------- ----------------------------EMPLOYEE_ID NOT NULL NUMBER(6)FIRST_NAME VARCHAR2(20)LAST_NAME NOT NULL VARCHAR2(25)EMAIL NOT NULL VARCHAR2(25)PHONE_NUMBER VARCHAR2(20)HIRE_DATE NOT NULL DATEJOB_ID NOT NULL VARCHAR2(10)SALARY NUMBER(8,2)COMMISSION_PCT NUMBER(2,2)MANAGER_ID NUMBER(6)DEPARTMENT_ID NUMBER(4) 12. Display the last name, hire date, and day of the week on which the employee started. Label the columnDAY. Order the results by the week starting with Monday.