Part C(2 points)/* Bill of Materials -Recursive *//* The following code retrieves the components required for manufacturingthe "Mountain-500 Black, 48" (Product 992). Use it as the starter codefor calculating the material cost reduction if the component 815is manufactured internally at the level 1 instead of purchasing itfor use at the level 0.Use the list price of a component asthe material cost for the component. WITH Parts(AssemblyID, ComponentID, PerAssemblyQty, EndDate, ComponentLevel) AS
(
SELECT b. ProductAssemblyID, b.ComponentID, b.PerAssemblyQty,
b. EndDate,0 AS ComponentLevel
FROM Production. BillOfMaterials AS b
WHERE b. ProductAssemblyID =992 AND b. EndDate IS NULL

UNION ALL

SELECT bom. ProductAssemblyID, bom. ComponentID, p. PerAssemblyQty,
bom. EndDate, ComponentLevel +1
FROM Production. BillOfMaterials AS bom
INNER JOIN Parts AS p
ON bom. ProductAssemblyID =p. ComponentID AND bom. EndDate IS NULL
)
SELECT AssemblyID, ComponentID, Name, PerAssemblyQty, ComponentLevel
FROM Parts AS p
INNER JOIN Production. Product AS pr
ON p. ComponentID =pr. ProductID
ORDER BY ComponentLevel, AssemblyID, ComponentID;

Sara is writing a program to input her monthly phone bills and output the month name and amount for the month with maximum amount. she has defined an array to hold the month names. complete the pseudocode program. [6] # program to output maximum month's phone bill monthname ["january", "february", "march", "april", "may", "june", "july", "august", "september", "october", "november", "december"] # define an array to hold the phone bills for each month

What is a rush associated with alcohol?

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';