Answer:
- def testInOrder(a1, a2, a3):
- aList = [a1, a2, a3]
- if(min(aList) != a1 ):
- return False
-
- if(max(aList) != a3):
- return False
-
- return True
-
- def inOrder(n1, n2, n3):
- print(testInOrder(n1, n2, n3))
-
- inOrder(2, 4, 5)
- inOrder(4, 3, 6)
- inOrder(4, 3, 2)
- inOrder(3, 5, 1)
Explanation:
Firstly we create a driver function testInOrder that takes 3 inputs, a1, a2, and a3 (Line 1).
Since the value of a1 to a3 must be in ascending order so we can check if the a1 and a3 are the minimum and maximum number among the three, respectively. To do so, put a1, a2 and a3 into a list (Line 2). Next, we can use the min function to check if the minimum number is a1 (Line 3). If not return False (Line 4).
We can use the similar way to check if the maximum number of list is a3. If not return False (Line 6-7).
If both of the if conditions are not met, return True (Line 9).
We can test our driver function by repeatedly call the inOrder function with different sets of arguments (Line 14 - 17). We shall get the output as follows:
True
False
False
False
Explanation: Well, One is soft copy is a document saved on a computer. & two They can be sent via e-mail or over a network connection, which makes them a more efficient and cost-efficient option than using hard copies for communications. & three ( just a bonus) , Soft copies are often seen as less vulnerable than hard copies of a document.
( I hope this helped <3 )
Answer:
Vendor B
Explanation:
Using letters to represent each vendor and the symbol < to express wich is less expensive the information in the problem can be resumed like this: A<C, B<C, B<D, D<A.
These expressions involving two vendors have at the left the less expensive vendor and at the right, the more expensive, every vendor that appears at the right in one of the relations can't be the less expensive, this disqualifies C, D, and A, then less expensive vendor is B.
Answer:
b. you need it to do your homework
Explanation: