A person without a lower limb or limbs may face huge cost to get prosthetic legs. A metal prosthesis can cost up to RM10,000 depending on the specifications and requirement of the patient. Cane furniture was made by bending the stem in such beautiful shapes that could also hold human weight. The usage of sustainable materials such as cane may help the sustainability of life of a person without a limb by ensuring it is affordable and available to people of all levels as well as helped the sustainability of the environment. However, one question - can you make a leg out of a cane? Discuss.

On Valentine’s Day, the price of roses increases by more than the price of greeting cards. Why? (Hint: Consider what makes roses and cards different and how that difference might affect supply’s responsiveness to price.)

please help and explain and do good 150-200 words

Present a through discussion of wireless networking. Include WiFi, Bluetooth, and Cellular in your discussion.

Dillon, Jones, and Kline, Ltd. is studying the acquisition of two electrical component insertion systems for producing its sole product, the universal gismo. Data relevant to the systems follow. Model A: Variable costs, $17.00 per unit Annual fixed costs, $986,400 Model B: Variable costs, $11.80 per unit Annual fixed costs, $1,114,000 The selling price is $68 per unit for the universal gismo, which is subject to a 5 percent sales commission. (In the following requirements, ignore income taxes.)

What about a friend from a different culture - can the two of you have personality similarities and differences?

. Explain the following terms:

                a. Purpose of an audit
                b. Accounting cycle and transaction process
                c. Balances
                d. Presentation and disclosure

I'm trying to make this C++ loan calculator but I can't get the program to output what I need. For instance I know the formula is right and when I enter 100000 1.5 20 as my cin variables I should get 482.55 but I get 1543.31. What am I not seeing as the issue? Also this should cout only 2 decimal places right? I'm not allowed to alter the #include and add any fixed setprecision.

This is what I have.

#include <iostream>
#include <cmath>
using namespace std;

int main() {
   // ---------------- Add code here --------------------
   // -- Declare necessary variables here              --
  
    int years = 0;
    int LoanAmount = 0;
    double AnnualRate = 0.0;
    double moPayment = 0.00;
  
    // --
    cout << "Enter the amount, rate as a percentage (e.g. 3.25), and number of years\n";
    cout << " separated by spaces: " << endl;

   // ---------------- Add code here --------------------
   // -- Receive input and compute the monthly payment --
   cin >> LoanAmount >> AnnualRate >> years;

   AnnualRate = AnnualRate / 100;    //rate to decimal
   years = years * 12;   //years to months

   moPayment = (LoanAmount * AnnualRate) / (1 - pow(1 + AnnualRate, -years));
  
   // ---------------- Add code here ------------------
    // Print out the answer as a double, all by itself
    // (no text) followed by a newline
    // Ex. cout << payment << endl;

   cout << moPayment << endl;

  
    return 0;
}

Evaluate the principles of systems thinking and the role of systems thinking in organisational change.

You would like to buy a house that costs $350,000. You have $50,000 in cash that you can put down on the​ house, but you need to borrow the rest of the purchase price. The bank is offering a​ 30-year mortgage that requires annual payments and has an interest rate of 7% per year. You can afford to pay only $23,500 per year. The bank agrees to allow you to pay this amount each​ year, yet still borrow $300,000. At the end of the mortgage​ (in 30​ years), you must make a balloon​ payment; that​ is, you must repay the remaining balance on the mortgage. How much will this balloon payment​ be?

The PV of the annuity is (Round to the nearest​ dollar.)

The balloon payment is (Round to the nearest​ dollar.)

​$nothing .

​ (Round to the nearest​ dollar.)

Problem 11-20 Project Analysis [LO1, 2]

Data Network Design & Evaluation

1. User Requirements: Name three user requirements and explain them briefly.

2. Application Requirements: Describe the different types of applications based on their performance requirements.

Complete the java program.

/*

Note: Do not add any additional methods, attributes.

Do not modify the given part of the program.

Run your program against the provided Homework2Driver.java for

requirements.

*/

/*

Hint: This Queue implementation will always dequeue from the first element of

the array i.e, elements[0]. Therefore, remember to shift all elements

toward front of the queue after each dequeue.

*/

public class QueueArray<T> {

public static int CAPACITY = 100;

private final T[] elements;

private int rearIndex = -1;

public QueueArray() {

}

public QueueArray(int size) {

}

public T dequeue() {

}

public void enqueue(T info) {

}

public boolean isEmpty() {

}

public boolean isFull() {

}

public int size() {

}

}

Run this program ( Homework2Driver.java ) to test.

Comment out sections that you have not finished, so it does not

interfere your troubleshooting.

For example, commenting out parts 2 and 3 while testing part 1.

public class Homework2Driver {

public static void main(String [] args) {

int score = 0;

// Part 1: Array based Queue - QueueArray.java

QueueArray myQueueArray = new QueueArray(2);

myQueueArray.dequeue();

if (myQueueArray.isEmpty() && !myQueueArray.isFull() && myQueueArray.size()

== 0)

score += 6;

myQueueArray.enqueue("Orange");

myQueueArray.enqueue("Mango");

myQueueArray.enqueue("Guava"); // Note: with Queue size 2, this won't get

into the queue.

if (myQueueArray.isFull())

score += 6;

if (myQueueArray.dequeue().equals("Orange") && myQueueArray.size() == 1

&& !myQueueArray.isEmpty())

score += 6;

if (myQueueArray.dequeue().equals("Mango") && myQueueArray.size() == 0 &&

myQueueArray.isEmpty())

score += 6;

// Part 2: Linked List based Queue - QueueLinkedList.java

QueueLinkedList myQueueList = new QueueLinkedList();

myQueueList.dequeue();

if (myQueueList.isEmpty() && myQueueList.size() == 0)

score += 6;

myQueueList.enqueue("Apple");

myQueueList.dequeue();

myQueueList.enqueue("Orange");

myQueueList.enqueue("Lemon");

if (myQueueList.dequeue().equals("Orange") && myQueueList.size() == 1 && !

myQueueList.isEmpty())

score += 6;

if (myQueueList.dequeue().equals("Lemon") && myQueueList.size() == 0 &&

myQueueList.isEmpty())

score += 6;

// Part 3: Linked List based Stack - StackLinkedList.java

StackLinkedList myStack = new StackLinkedList();

myStack.pop();

if (myStack.isEmpty() && myStack.size() == 0)

score += 6;

myStack.push("Peach");

if (!myStack.isEmpty() && myStack.size() == 1)

score += 6;

myStack.pop();

myStack.push("Pineapple");

if (myStack.pop().equals("Pineapple") && myStack.isEmpty() &&

myStack.size() == 0)

score += 6;

System.out.printf("your score is %d/60 \n", score);

}

}