The declaration of the JellyBeanJar class is given below. Instances of the JellyBeanJar class represent bean jars of varying capacity. The member variable maxJellyBeans represents the capacity of the jar. The member variable Jellybeans represents the current number of jelly beans in the jar, which must be less than or equal to maxJellyBeans. The class provides functions to add jelly beans, remove jelly beans, and get the number of jelly beans that are currently in the jelly bean jar. The functions to add and remove jelly beans return a boolean value that indicates whether the operation succeeded or failed. When one of these functions fails, the number of jelly beans in the jar will not have been changed. For example, if a jelly bean jar has a capacity of 10 jelly beans and there are 9 jelly beans currently in the jar, then addJellyBeans(2) will return false and the number of jelly beans in the jar will remain at 9.
class JellyBeanJar {
public:
JellyBeanJar(int maxB, int b);
int getJellyBeans() const;
bool addJellyBeans(int b);
bool removeJellyBeans(int b);
private:
int maxJellyBeans;
int Jellybeans;
};
Please write the implementation of the constructor and the addJellyBeans function.

We as humans write math expression in infix notation, e.g. 5 + 2 (the operators are written in-between the operands). in a computer’s language, however, it is preferred to have the operators on the right side of the operands, i.e. 5 2 +. for more complex expressions that include parenthesis and multiple operators, a compiler has to convert the expression into postfix first and then evaluate the resulting postfix.write a program that takes an “infix” expression as input, uses stacks to convert it into postfix expression, and finally evaluates it. it must support the following operations: + - / * ^ % (example infix expression: (7 - 3) / (2 + 2)postfix expression: 7 3 - 2 2 + /result: 1guidelines: 1. you will need to use stacks in three placesa. one for the parenthesis check [char stack]b. one during infix to postfix [char stack]c. one during evaluation [int stack]for a and b above, you can use same array and same push, pop method as both ofthem are char. but for evaluation you have int stack and you might consider to createanother push pop method to handle it. maybe push_int, pop_int, etc. or find otherstrategy to utilize existing push pop method2. you can create a function for obtaining operator priority. that function should take anoperator as input and return its priority as an integer. this function will you a lot andreduce repeated code3. during evaluation you will need to convert char into integer. example for single digit: char c = '5'; int x = c - '0';

What is one reason why indoor air pollution has become an increasing problem.

For which utilities, if any, does the landlord pay?