Given a set S = {a1, a2, ..., an} of positive integers (denoting asset values), Set partitioning requires to partition S into two subsets S1 and S2 that minimizes the difference in the total (asset) values of S1 and S2. Identify a dynamic programming (DP) algorithm for the Set partition problem. Clarify all relevant details, justifying the DP formulation, and analyze your time-complexity. Illustrate the working of your DP algorithm, partitioning this example set S = {10, 6, 4, 4, 4, 3}

Write c function that can replace all the positive elements to 0 and negative to 1 in undefined length one-dimensional array. test your program in the main program by defining one-dimensional array of 6 elements

Write a program that uses a widgetviewer object to do the following: generate two random integers between 1 and 9 (inclusive). name one of them x, the other y. display them to the user using jlabel objects. create a jlabel object displaying the text "enter an operation number." create a jtextfield for the user's input. create a jbutton displaying the text "press here when you've entered your operation." use addandwait to add it to the widgetviewer object. when the user clicks the jbutton, evaluate operation in the following order to determine the one and only mathematical operation to perform on x and y. use a jlabel to display the result. if operation is between 1 and 10 inclusive, add x and y. if operation is evenly divisible by 4, subtract y from x. if operation is evenly divisible by 5, use integer division to divide y into x. if operation is an even number, use floating point division to divide y into x. if none of the other tests on operation apply, multiply x and y. note: operation can be negative or zero.

What are listed in the vertical columns across the top of the event editor? a. file names b. conditions c. check marks d. action types