Answer:
1) Debit Prepaid insurance, Credit Bank
2) Debit wages, credit Bank
3) Debit Supplies Account , Credit Accounts payable
4) Debit Utility account credit Accounts payable
Explanation:
The Question requires that for each of the transaction identify account to be debited and account to be credit.
clear transactions end at the 4th transaction. After the 4th its just terms and accounts
Answer:
a. Must have a good faith belief that the tax return position will be accepted by the IRS.
Explanation:
Certified Public Accountant (CPA) is a term used to refer to the state title of approved accountants in the Uniform Certified Public Accountant Examination. The CPA allows these professionals to issue opinion statements in financial reports, following a few rules. For example, the Tax Services Standards Statement No. 1 states that a basic principle of the provision of tax services that the CPA has is to have a good faith belief that the tax return position will be accepted by the IRS.
Answer:
false, they sent the calendar hoping he would make a donation, but he does not have to give any money
Explanation:
they sent the calendar hoping he would make a donation, but he does not have to give any money
Answer:
jul-01 Prepaid expenses 13.620
jul-01 Cash 13.620
dec-31 Insurance policy expense 2.270
dec-31 Prepaid expenses 2.270
Explanation:
Paid 1-jul 13620
Three Years 13.620 36 months
Monthly 378 month
Current Year 2.270 6 months
jul-01 Prepaid expenses 13.620
jul-01 Cash 13.620
dec-31 Insurance policy expense 2.270
dec-31 Prepaid expenses 2.270
Answer:
They should operate Mine 1 for 1 hour and Mine 2 for 3 hours to meet the contractual obligations and minimize cost.
Explanation:
The formulation of the linear programming is:
Objective function:
Restrictions:
- High-grade ore: 
- Medium-grade ore: 
- Low-grade ore: 
- No negative hours: 
We start graphing the restrictions in a M1-M2 plane.
In the figure attached, we have the feasible region, where all the restrictions are validated, and the four points of intersection of 2 restrictions.
In one of this four points lies the minimum cost.
Graphically, we can graph the cost function over this feasible region, with different cost levels. When the line cost intersects one of the four points with the lowest level of cost, this is the optimum combination.
(NOTE: it is best to start with a low guessing of the cost and going up until it reaches one point in the feasible region).
The solution is for the point (M1=1, M2=3), with a cost of C=$680.
The cost function graph is attached.
