1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
Elena-2011 [213]
3 years ago
13

Based on what you have read, what type of tax is Robert paying? a tariff a sales tax an excise tax a corporate tax

SAT
1 answer:
kakasveta [241]3 years ago
6 0

Answer:

C- An excise tax

Explanation:

Correct on edge

You might be interested in
Examine this system of equations. Which numbers can be multiplied by each equation so that when the two equations are added toge
Slav-nsk [51]

Answer:

the hell

Explanation:

5 0
3 years ago
What happens to carbon in plants when the plants die?.
ololo11 [35]

Answer:

It get released into the atmosphere

Explanation:

8 0
2 years ago
A client is 45 years old and has a resting heart rate of 75 bpm issa.
Firlakuza [10]

The target heart rate of the 45 year old client with a resting heart rate of 75 bpm is; 135 bpm

Complete question is;

A client is 45 years old and has a resting heart rate of 75 bpm using the karvonen formula what is their target heart rate at an exercise intensity of 60%.

We are given;

Age of client = 45 years

Resting Heart rate = 75 bpm

%Intensity = 60%

The karvonen formula is;

Target Heart Rate = [(max HR − resting HR) × %Intensity] + resting HR

Formula for maximum heart rate is;

Max HR = 220 - age

Max heart rate = 220 - 45

Max HR = 175 bpm

Thus;

Target Heart rate = [(175 - 75) × 0.6] + 75

Target Heart rate = (100 × 0.6) + 75

Target Heart rate = 60 + 75

Target Heart rate = 135 bpm

Read more on target heart rate at; brainly.com/question/7593179

3 0
2 years ago
Once you have your heap structure created, next you must use it as a backing structure to a priority queue. Develop a PriorityQu
saveliy_v [14]

Using the knowledge in computational language in python it is possible to write a code that Develop a PriorityQueue data structure in a file.

<h3>Writting the code in python:</h3>

<em>import sys</em>

<em>class Node:</em>

<em>def __init__(self,key):</em>

<em>self.left = None</em>

<em>self.right = None</em>

<em>self.val = key</em>

<em>self.parent = None</em>

<em>class MinHeap:</em>

<em>def __init__(self, maxsize):</em>

<em>self.maxsize = maxsize</em>

<em>self.size = 0</em>

<em>self.Heap = Node(-1 * sys.maxsize )</em>

<em>self.FRONT = self.Heap</em>

<em># A utility function to do inorder tree traversal</em>

<em>def isLeaf(self, node):</em>

<em>if node.left == None and node.right == Node:</em>

<em>return True</em>

<em>return False</em>

<em># Function to swap two nodes of the heap</em>

<em>def swap(self, node1, node2):</em>

<em>node1.data, node2.data = node2.data, node1.data</em>

<em># Function to heapify the node at pos</em>

<em>def minHeapify(self, node):</em>

<em># If the node is a non-leaf node and greater</em>

<em># than any of its child</em>

<em>if not self.isLeaf(node):</em>

<em>if (node.data > node.left.data or</em>

<em>node.data > node.right.data):</em>

<em># Swap with the left child and heapify</em>

<em># the left child</em>

<em>if node.left.data < node.right.data:</em>

<em>self.swap(node, node.left)</em>

<em>self.minHeapify(node.left)</em>

<em># Swap with the right child and heapify</em>

<em># the right child</em>

<em>else:</em>

<em>self.swap(node, node.right)</em>

<em>self.minHeapify(node.right)</em>

<em># Function to insert a node into the heap</em>

<em>def insert(self, element):</em>

<em>if self.size >= self.maxsize :</em>

<em>return</em>

<em>self.size+= 1</em>

<em>self.bst_insert(FRONT, element)</em>

<em>current = FRONT</em>

<em>while current.parent != None and current.data < current.parent.data:</em>

<em>self.swap(current, current.parent)</em>

<em>current = current.parent</em>

<em># Function to print the contents of the heap</em>

<em>def Print(self):</em>

<em>self.inorder()</em>

<em># Function to build the min heap using</em>

<em># the minHeapify function</em>

<em>def inorder(self, root):</em>

<em>if root:</em>

<em>inorder(root.left)</em>

<em>print(root.val)</em>

<em>inorder(root.right)</em>

<em>def bst_insert(self, root, node):</em>

<em>if root is None:</em>

<em>root = node</em>

<em>else:</em>

<em>root.next = node</em>

<em>self.FRONT = node</em>

<em># Driver Code</em>

<em>if __name__ == "__main__":</em>

<em>r = Node(50)</em>

<em>bst_insert(r,Node(30))</em>

<em>bst_insert(r,Node(20))</em>

<em>bst_insert(r,Node(40))</em>

<em>bst_insert(r,Node(70))</em>

<em>bst_insert(r,Node(60))</em>

<em>bst_insert(r,Node(80))</em>

<em># Print inoder traversal of the BST</em>

<em>inorder(r)</em>

<em>print('The minHeap is ')</em>

<em>minHeap = MinHeap(15)</em>

<em>minHeap.insert(5)</em>

<em>minHeap.insert(3)</em>

<em>minHeap.insert(17)</em>

<em>minHeap.insert(10)</em>

<em>minHeap.insert(84)</em>

<em>minHeap.insert(19)</em>

<em>minHeap.insert(6)</em>

<em>minHeap.insert(22)</em>

<em>minHeap.insert(9)</em>

<em>minHeap.minHeap()</em>

<em>minHeap.Print()</em>

<em>print("The Min val is " + str(minHeap.remove()))</em>

See more about python at brainly.com/question/13437928

#SPJ1

6 0
1 year ago
U-U * i must say :O REEEeeeeeeeeee *gets thrown of window * levi: :P ha now stop texting -__- * * T^T am hiding for the love of
Gnom [1K]
The advancement of uwueuwu is the correct answer
4 0
2 years ago
Read 2 more answers
Other questions:
  • In your opinion, did the speaker actually hear a ghost? Why or why not?
    10·1 answer
  • Explain the motion of a hockey puck in terms of Newton's first law
    10·1 answer
  • Suatu perasaan Sebagai respons dari keadaan orang lain yang sedang menderita atau mengalami kesusahan dinamakan
    12·1 answer
  • If your cover letter will be processed digitally, it should include ___________
    15·1 answer
  • How many hours should a person each day?
    6·1 answer
  • What is the probability of dying between ages 70 and 71?
    10·2 answers
  • REALIZA UN RESUMEN DONDE EXPLIQUES LAS HABILIDADES SOCIALES DE UN EMPRENDEDOR
    10·1 answer
  • A hoop of radius 1. 0 m is placed in the first quadrant of an xy-coordinate system with its rim touching both the x-axis and the
    9·1 answer
  • At which event must special care be taken when preparing food
    8·1 answer
  • This musical excerpt has a wide dynamic range, moving between piano and forte.
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!