hello sir , i just want the final answer i dont full answer, i promise to comment and like your solution, please answer all of the question because theres no time post the qusteions anathoer time and i dont want the full answer,only the last answer but please solve all of question ,thank u

The time complexity of BF knapsack problem is

a.polynomial

b.logarithmic

c.factorial

d.exponential

-------------------

It is not creative technique and rarely gives an efficient time

a.D&C

b.Dec&C

c.Transformation

d.BF

---------------------

Writing pseudo code for an algorithm belong to

Select one:

a.design step

b.analyzing step

c.coding step

d.None of these

--------------------------

The recurrence equation is T(n)= 2T(n/2) - n then the master theorem case is

Select one:

a.case 2

b.case 3

c.Not applicable

d.case 1