If you have been given the full amount required and the list represents the amount of change in your pocket, decide whether you can afford the item or not. Change will always be represented as follows: quarters, dimes, nickels, pens. Illustration: change Enough ([25, 20, 5, 0], 4.25) should prove true, as having 25 quarters, 20 dimes, 5 nickels and 0 pens gives you 6.25 + 2 + .25 + 0 = 8.50. Examples changeEnough ([2, 100, 0, 0], 14.11) → false changeEnough ([0, 0, 20, 5], 0.75)→ true changeEnough ([30, 40, 20, 5], 12.55) → truth changeEnough ([10, 0, 0, 50], 3.85) → false change Enough ([1, 0, 5, 219], 19.99) → false Solve in Java script

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
If you have been given the full amount required and the list
represents the amount of change in your pocket, decide
whether you can afford the item or not. Change will always be
represented as follows: quarters, dimes, nickels, pens.
Illustration: change Enough ([25, 20, 5, 0], 4.25) should
prove true, as having 25 quarters, 20 dimes, 5 nickels and 0
pens gives you 6.25 + 2 + .25 + 0 = 8.50.
Examples
changeEnough ([2, 100, 0, 0], 14.11) → false
changeEnough ([0, 0, 20, 5], 0.75) →> true
changeEnough ([30, 40, 20, 5], 12.55) → truth
changeEnough ([10, 0, 0, 50], 3.85) → false
change Enough ([1, 0, 5, 219], 19.99) → false
Solve in Java script
Transcribed Image Text:If you have been given the full amount required and the list represents the amount of change in your pocket, decide whether you can afford the item or not. Change will always be represented as follows: quarters, dimes, nickels, pens. Illustration: change Enough ([25, 20, 5, 0], 4.25) should prove true, as having 25 quarters, 20 dimes, 5 nickels and 0 pens gives you 6.25 + 2 + .25 + 0 = 8.50. Examples changeEnough ([2, 100, 0, 0], 14.11) → false changeEnough ([0, 0, 20, 5], 0.75) →> true changeEnough ([30, 40, 20, 5], 12.55) → truth changeEnough ([10, 0, 0, 50], 3.85) → false change Enough ([1, 0, 5, 219], 19.99) → false Solve in Java script
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Lower bounds sorting algorithm
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education