Which of the following is not true about greedy algorithms?
a. it makes the locally optimal choice at each stage
b. a greedy strategy produces an optimal solution
c. a greedy algorith exists for constructing the minimum spanning tree
d. a greedy algorithm exists for partition a set of n weights into k buns where each has the same weight
e. greedy algorithm exists for some np-hard problems.

What is added to the < meta > tag to describe the encoding type?

What kind of software users of all skill levels create web pages that include graphics, video, audio, animation, and other special effects? website authoring website software website publishing website editing

Assume the existence of a bankaccount class. define a derived class, savingsaccount that contains two instance variables: the first a double, named interestrate, and the second an integer named interesttype. the value of the interesttype variable can be 1 for simple interest and 2 for compound interest. there is also a constructor that accepts two parameters: a double that is used to initialize the interestrate variable, and a string that you may assume will contain either "simple", or "compound", and which should be used to initialize the interesttype variable appropriately. there should also be a pair of functions getinterestrate and getinteresttype that return the values of the corresponding data members (as double and int respectively).