Answer:
2. From the Reports Center, select Budgets & Forecasts > Budget Overview
Explanation:
In order to print a budget, the step is: From the Reports Center, select Budgets & Forecasts > Budget Overview
Answer:
hold on i wrote this in my engineeering class hold on
Explanation:
but just wait
Answer:
Task 1: T = c + (2.5n(A/M))+ m(1+r/100)ⁿ
Task 2: In both 5 & 10 years, Car A is more economical
Task 3: Printing returns the answer in a different dialogue box while return displays the answer in the same window.
Explanation:
Task 1:
C = Cost of car
n = Number of years
m = Maintenance Cost
r = Rate
M = Mileage per gallon
A = Annual mileage
T= Total Cost
T = c + (2.5n(A/M))+ m(1+r/100)ⁿ
Task 2
Car A In 5 years; T = 20000+ (2.5*5(15000/25))+1300(1+0.15)⁵= $30115
Car B In 5 years; T = 30000+ (2.5*5(15000/32))+1000(1+0.10)⁵= $37470
Therefore in 5 years, Car A is more economical.
Car A In 10 years; T = 20000+ (2.5*10(15000/25))+1300(1+0.15)¹⁰= $40259.225
Car B In 10 years; T = 30000+ (2.5*10(15000/32))+1000(1+0.10)¹⁰= $ 44312.49
Therefore in 10 years, Car A is still economical.
Task 3: Printing returns the answer in a different dialogue box while return displays the answer in the same window.
Answer:
O(nlogn)
Explanation:
Heap sort is a sorting algorithm which makes use of the heap data structure. An array consisting of n elements is first transformed into a heap (O(log n)) and the lowest element is extracted from this heap with restoration of the heap property(O(n)). So the overall time complexity of the entire operation is O(nlogn). For example it the input consists of 10 elements, the time complexity will be O(10log10).
1 is B
2 is C
3 is A
Verified all the answers.