Math
Discrete Mathematics With ApplicationsLet O denote the matrix [ 0 0 0 0 ] . Find 2 × 2 matrices A and B such that A ≠ O and B ≠ O but A B = O .
close solutoin list

Let O denote the matrix [ 0 0 0 0 ] . Find 2 × 2 matrices A and B such that A ≠ O and B ≠ O but A B = O .

BuyFind

Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
Publisher: Cengage Learning,
ISBN: 9781337694193
BuyFind

Discrete Mathematics With Applicat...

5th Edition
EPP + 1 other
Publisher: Cengage Learning,
ISBN: 9781337694193

Solutions

Chapter
Section
Problem 1TY
Problem 2TY
Problem 3TY
Problem 4TY
Problem 5TY
Problem 6TY
Problem 1ES
Problem 2ES
Problem 3ES
Problem 4ES
Problem 5ES
Problem 6ES
Problem 7ES
Problem 8ES
Problem 9ES
Problem 10ES
Problem 11ES
Problem 12ES
Problem 13ES
Problem 14ES
Problem 15ES
Problem 16ES
Problem 17ES
Problem 18ES
Problem 19ES
Problem 20ES
Problem 21ES
Problem 22ES
Problem 23ES
Chapter 10.2, Problem 12ES
Textbook Problem

Let O denote the matrix [ 0 0 0 0 ] . Find 2 × 2 matrices A and B such that A ≠ O and B ≠ O but A B = O .

Expert Solution

Want to see the full answer?

Check out a sample textbook solution.See solution
Chapter 10.2,
Problem 11ES
Chapter 10.2,
Problem 13ES

Want to see this answer and more?

Experts are waiting 24/7 to provide step-by-step solutions in as fast as 30 minutes!*

See Solution

*Response times vary by subject and question complexity. Median response time is 34 minutes and may be longer for new subjects.

Chapter 10 Solutions

Discrete Mathematics With Applications
Show all chapter solutions
Ch. 10.1 - Let G be a graph and let v and w be vertices in G....Ch. 10.1 - A graph is connected if, any only if, _____.Ch. 10.1 - Removing an edge from a circuit in a graph does...Ch. 10.1 - An Euler circuit in graph is _____.Ch. 10.1 - A graph has a Euler circuit if, and only if,...Ch. 10.1 - Given vertices v and w in a graph, there is an...Ch. 10.1 - A Hamiltonian circuit in a graph is ______.Ch. 10.1 - If a graph G has a Hamiltonian circuit, then G has...Ch. 10.1 - A travelling salesman problem involves finding a...Ch. 10.1 - In the graph below, determine whether the...
Ch. 10.1 - In the graph below, determine whether the...Ch. 10.1 - Let G be the graph and consider the walk...Ch. 10.1 - Consider the following graph. How many paths are...Ch. 10.1 - Consider the following graph. How many paths are...Ch. 10.1 - An edge whose removal disconnects the graph of...Ch. 10.1 - Given any positive integer n, (a) find a connected...Ch. 10.1 - Find the number of connected components for each...Ch. 10.1 - Each of (a)—(c) describes a graph. In each case...Ch. 10.1 - The solution for Example 10.1.6 shows a graph for...Ch. 10.1 - Is it possible for a citizen of Königsberg to make...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Determine which of the graph in 12-17 have Euler...Ch. 10.1 - Is it possible to take a walk around the city...Ch. 10.1 - For each of the graph in 19-21, determine whether...Ch. 10.1 - For each of the graph in 19-21, determine whether...Ch. 10.1 - For each of the graph in 19-21, determine whether...Ch. 10.1 - The following is a floor plan of a house. Is it...Ch. 10.1 - Find all subgraph of each of the following graphs.Ch. 10.1 - Find the complement of each of the following...Ch. 10.1 - Find the complement of the graph K4, the complete...Ch. 10.1 - Suppose that in a group of five people A,B,C,D,...Ch. 10.1 - Let G be a simple graph with n vertices. What is...Ch. 10.1 - Show that at a party with at least two people,...Ch. 10.1 - Find Hamiltonian circuits for each of the graph in...Ch. 10.1 - Find Hamiltonian circuits for each of the graph in...Ch. 10.1 - Show that none of graphs in 31-33 has a...Ch. 10.1 - Show that none of graphs in 31-33 has a...Ch. 10.1 - Show that none of graphs in 31-33 has a...Ch. 10.1 - In 34-37, find Hamiltonian circuits for those...Ch. 10.1 - In 34-37, find Hamiltonian circuits for those...Ch. 10.1 - In 34-37, find Hamiltonian circuits for those...Ch. 10.1 - In 34-37, find Hamiltonian circuits for those...Ch. 10.1 - Give two examples of graphs that have Euler...Ch. 10.1 - Give two examples of graphs that have Hamiltonian...Ch. 10.1 - Give two examples of graphs that have circuits...Ch. 10.1 - Give two examples of graphs that have Euler...Ch. 10.1 - A traveler in Europe wants to visit each of the...Ch. 10.1 - a. Prove that if a walk in a graph contains a...Ch. 10.1 - Prove Lemma 10.1.1(a): If G is a connected graph,...Ch. 10.1 - Prove Lemma 10.1.1(b): If vertices v and w are...Ch. 10.1 - Draw a picture to illustrate Lemma 10.1.1(c): If a...Ch. 10.1 - Prove that if there is a trail in a graph G from a...Ch. 10.1 - If a graph contains a circuits that starts and...Ch. 10.1 - Prove that if there is a circuit in a graph that...Ch. 10.1 - Let G be a connected graph, and let C be any...Ch. 10.1 - Prove that any graph with an Euler circuit is...Ch. 10.1 - Prove Corollary 10.1.5.Ch. 10.1 - For what values of n dies the complete graph Kn...Ch. 10.1 - For what values of m and n does the complete...Ch. 10.1 - What is the maximum number of edges a simple...Ch. 10.1 - Prove that if G is any bipartite graph, then every...Ch. 10.1 - An alternative proof for Theorem 10.1.3 has the...Ch. 10.2 - In the adjacency matrix for a directed graph, the...Ch. 10.2 - In the adjacency matrix for an undirected graph,...Ch. 10.2 - An n × n square matrix is called symmetric if, and...Ch. 10.2 - The ijth entry in the produce of two matrices A...Ch. 10.2 - In an n × n identity matrix, the entries on the...Ch. 10.2 - If G is a graph with vertices v1, v2, …., vn and A...Ch. 10.2 - Find real numbers a, b, and c such that the...Ch. 10.2 - Find the adjacency matrices for the following...Ch. 10.2 - Find directed graphs that have the following...Ch. 10.2 - Find adjacency matrices for the following...Ch. 10.2 - Find graphs that have the following adjacency...Ch. 10.2 - The following are adjacency matrices for graphs....Ch. 10.2 - Suppose that for every positive integer I, all the...Ch. 10.2 - Find each of the following products. [21][13]...Ch. 10.2 - Find each of the following products? a....Ch. 10.2 - Let A = [ 1 1 1 0 2 1] , B = [ 2 0 1 3] and C =...Ch. 10.2 - Give an example different from that in the text to...Ch. 10.2 - Let O denote the matrix [0000] . Find 2 × 2...Ch. 10.2 - Let O denote the matrix [0000] . Find 2 × 2...Ch. 10.2 - In 14-18, assume the entries of all matrices are...Ch. 10.2 - In 14-18, assume the entries of all matrices are...Ch. 10.2 - In 14-18, assume the entries of all matrices are...Ch. 10.2 - In 14-18, assume the entries of all matrices are...Ch. 10.2 - In 14—18, assume the entries of all matrices are...Ch. 10.2 - Let A = [112101210] . Find A2 and A3. Let G be the...Ch. 10.2 - The following is an adjacency matrix for a graph:...Ch. 10.2 - Let A be the adjacency matrix for K3, the complete...Ch. 10.2 - Draw a graph that has [0001200011000211120021100]...Ch. 10.2 - Let G be a graph with n vertices, and let v and w...Ch. 10.3 - If G and G’ are graphs, then G is isomorphic to G’...Ch. 10.3 - A property P is an invariant for graph isomorphism...Ch. 10.3 - Some invariants for graph isomorphism are , , , ,...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 1-5, determine...Ch. 10.3 - For each pair of graphs G and G in 1—5, determine...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - For each pair of simple graphs G and G in 6—13,...Ch. 10.3 - For each pair of graphs G and G’ in 6-13,...Ch. 10.3 - Draw all nonisomorphic simple graphs with three...Ch. 10.3 - Draw all nonisomorphic simple graphs with four...Ch. 10.3 - Draw all nonisomorphic graphs with three vertices...Ch. 10.3 - Draw all nonisomorphic graphs with four vertices...Ch. 10.3 - Draw all nonisomorphic graphs with four vertices...Ch. 10.3 - Draw all nonisomorphic graphs with six vertices,...Ch. 10.3 - Draw four nonisomorphic graphs with six vertices,...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Prove that each of the properties in 21-29 is an...Ch. 10.3 - Show that the following two graphs are not...Ch. 10.4 - A circuit-free graph is a graph with __________.Ch. 10.4 - A forest is a graph that is _________, and a tree...Ch. 10.4 - A trivial tree is a graph that consists of...Ch. 10.4 - Any tree with at least two vertices has at least...Ch. 10.4 - If a tree T has at least two vertices, then a...Ch. 10.4 - For any positive integer n, any tree with n...Ch. 10.4 - For any positive integer n, if G is a connected...Ch. 10.4 - Read the tree in Example 10.4.2 from left to right...Ch. 10.4 - Draw trees to show the derivations of the...Ch. 10.4 - What is the total degree of a tree with n...Ch. 10.4 - Let G be the graph of a hydrocarbon molecule with...Ch. 10.4 - Extend the argument given in the proof of Lemma...Ch. 10.4 - If graphs are allowed to have an infinite number...Ch. 10.4 - Find all leaves (or terminal vertices) and all...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - In each of 8—21, either draw a graph with the...Ch. 10.4 - A connected graph has twelve vertices and eleven...Ch. 10.4 - A connected graph has nine vertices and twelve...Ch. 10.4 - Suppose that v is a vertex of degree 1 in a...Ch. 10.4 - A graph has eight vertices and six edges. Is it...Ch. 10.4 - If a graph has n vertices and n2 or fewer can it...Ch. 10.4 - A circuit-free graph has ten vertices and nine...Ch. 10.4 - Is a circuit-free graph with n vertices and at...Ch. 10.4 - Prove that every nontrivial tree has at least two...Ch. 10.4 - Find all nonisomorphic trees with five vertices.Ch. 10.4 - a. Prove that the following is an invariant for...Ch. 10.5 - A rooted tree is a tree in which . The level of a...Ch. 10.5 - A binary tree is a rooted tree in which .Ch. 10.5 - A full binary tree is a rooted tree in which .Ch. 10.5 - If k is a positive integer and T is a full binary...Ch. 10.5 - If T is a binary tree that has t leaves and height...Ch. 10.5 - Consider the tree shown below with root a. a. What...Ch. 10.5 - Consider the tree shown below with root v0 . a....Ch. 10.5 - Draw binary trees to represent the following...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In each of 4—20, either draw a graph with the...Ch. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.5 - In 21-25, use the steps of Algorithm 10.5.1 to...Ch. 10.6 - A spanning tree for a graph G is .Ch. 10.6 - A weighted graph is a graph for which and the...Ch. 10.6 - A minimum spanning tree for a connected, weighted...Ch. 10.6 - In Kruskal’s algorithm, the edges of a connected,...Ch. 10.6 - In Prim’s algorithm, a minimum spanning tree is...Ch. 10.6 - In Dijkstra’s algorithm, a vertex is in the fringe...Ch. 10.6 - At each stage of Dijkstra’s algorithm, the vertex...Ch. 10.6 - Find all possible spanning trees for each of the...Ch. 10.6 - Find all possible spanning trees for each of the...Ch. 10.6 - Find a spanning trees for each of the graphs in 3...Ch. 10.6 - Find a spanning trees for each of the graphs in 3...Ch. 10.6 - Use Kruskal’s algorithm to find a minimum spanning...Ch. 10.6 - Use Kruskal’s algorithm to find a minimum spanning...Ch. 10.6 - Use Prim’s algorithm starting with vertex a or...Ch. 10.6 - Use Prim’s algorithm starting with vertex a or...Ch. 10.6 - For each of the graphs in 9 and 10, find all...Ch. 10.6 - For each of the graphs in 9 and 10, find all...Ch. 10.6 - A pipeline is to be built that will link six...Ch. 10.6 - Use Dijkstra’s algorithm for the airline route...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Use Dijkstra’s algorithm to find the shortest path...Ch. 10.6 - Prove part (2) of Proposition 10.6.1: Any two...Ch. 10.6 - Given any two distinct vertices of a tree, there...Ch. 10.6 - Prove that if G is a graph with spanning tree T...Ch. 10.6 - Suppose G is a connected graph and T is a...Ch. 10.6 - a. Suppose T1 and T2 are two different spanning...Ch. 10.6 - Prove that an edge e is contained in every...Ch. 10.6 - Consider the spanning trees T1and T2in the proof...Ch. 10.6 - Suppose that T is a minimum spanning tree for a...Ch. 10.6 - Prove that if G is a connected, weighted graph and...Ch. 10.6 - If G is a connected, weighted graph and no two...Ch. 10.6 - Prove that if G is a connected, weighted graph and...Ch. 10.6 - Suppose a disconnected graph is input to Kruskal’s...Ch. 10.6 - Suppose a disconnected graph is input to Prim’s...Ch. 10.6 - Modify Algorithm 10.6.3 so that the output...Ch. 10.6 - Prove that if a connected, weighted graph G is...

Additional Math Textbook Solutions

Find more solutions based on key concepts
Show solutions
QUALITY CONTROL The McCormack Company manufactures solar panel. As a part of its quality control, the company c...

Finite Mathematics for the Managerial, Life, and Social Sciences

In Exercises 4756, solve the given equation for the indicated variable. 27=32x1

Finite Mathematics

Explain how to calculate the standard divisor of an apportionment for a total population p with n items to appo...

Mathematical Excursions (MindTap Course List)

In Exercises 43-46, fill in the banks with what are most likely to be the next letters. Explain using complete ...

Mathematics: A Practical Odyssey

Find the area of the shaded segment shown. Round the answer to 2 decimal places.

Mathematics For Machine Technology

Add, subtract, or multiply the following signed numbers: (+7)(+3)

Elementary Technical Mathematics

In parts (a)-(d) of Problems 41 and 42, integrate those that can be done by the methods studied so far. 41. (a)...

Mathematical Applications for the Management, Life, and Social Sciences

Finding or Evaluating an Integral In Exercises 5360, find or evaluate the integral. 0/211+sin+cosd

Calculus: Early Transcendental Functions (MindTap Course List)

Draw an acute triangle and construct the three medians of the triangle. Do the medians appear to meet at a comm...

Elementary Geometry for College Students

Prove that ddx(cotx)=csc2x.

Calculus (MindTap Course List)

In the theory of relativity, the mass of a particle with speed is m=f()=m012/c2 where m0 is the rest mass of t...

Calculus: Early Transcendentals

List the three factors that determine the amount of interest charged on a loan. (10-1)

Contemporary Mathematics for Business & Consumers

True or false Label each of the following statement as either true or false. Let and be integers, then .

Elements Of Modern Algebra

Let F(x, y, z) = Pi + Qj + Rk have continuous first partial derivatives and S be a smooth, simple, connected, a...

Study Guide for Stewart's Multivariable Calculus, 8th

Verifying the Basic Exponential Limit Choose several values of a that are less than 1, and for each choice, mak...

Functions and Change: A Modeling Approach to College Algebra (MindTap Course List)

If sinx=13 and secy=54, where x and y lie between 0 and /2, evaluate the expression. 59. sin(x + y)

Single Variable Calculus

Use a calculator for Exercises 51 and 52. Find log68.

College Algebra (MindTap Course List)

π does not exist

Study Guide for Stewart's Single Variable Calculus: Early Transcendentals, 8th

The Grocery Manufacturers of America reported that 76% of consumers read the ingredients listed on a products l...

STATISTICS F/BUSINESS+ECONOMICS-TEXT

Systems of Linear Equations in Several Variables Find the complete solution of the system, or show that the sys...

Precalculus: Mathematics for Calculus (Standalone Book)

Publishing Costs Marjory Maureen Duffin is CEO of publisher Duffin House, a major supplier of paperback titles ...

Applied Calculus

Find all possible real solutions of each equation in Exercises 3144. 3x6x412x2+4=0

Finite Mathematics and Applied Calculus (MindTap Course List)

Review Exercises Construct rhombus ABCD, given these lengths for the diagonals.

Elementary Geometry For College Students, 7e

(757272)1

Applied Calculus for the Managerial, Life, and Social Sciences: A Brief Approach

Each of the following studies examines the relationship between sugar consumption and activity level for presch...

Research Methods for the Behavioral Sciences (MindTap Course List)

In a regression analysis involving 27 observations, the following estimated regression equation was developed: ...

Statistics for Business & Economics, Revised (MindTap Course List)

Evaluate the integral. 65. sin2x1+cos4xdx

Single Variable Calculus: Early Transcendentals

Mass In Exercises 25-28, find the total mass of the wire with density whose shape is modeled by r. r(t)=2costi...

Calculus: Early Transcendental Functions

Describe what it means to say that science is empirical, public, and objective, and explain why each of these p...

Research Methods for the Behavioral Sciences (MindTap Course List)

For Problems 1-10, answer true or false. The multiplicative inverse of 0 is 0.

Intermediate Algebra

Leisure: Maui Vacation How expensive is Maui? It you want a vacation rental condominium (up to four people), vi...

Understanding Basic Statistics

Chocolate Consumption. The United States ranks ninth in the world in per capita chocolate consumption; Forbes r...

Essentials Of Statistics For Business & Economics

Deciding Whether Equations Are Functions In Exercises 1-8, decide whether the equation defines y as a function ...

Calculus: An Applied Approach (MindTap Course List)

Callahan (2009) conducted a study to evaluate the effectiveness of physical exercise programs for individuals w...

Statistics for The Behavioral Sciences (MindTap Course List)

The article Rethinking Calcium Supplements (US Airways Magazine, October 2010) describes a study investigating ...

Introduction To Statistics And Data Analysis

Let A denote the percentage of one constituent in a randomly selected rock specimen, and let B denote the perce...

Probability and Statistics for Engineering and the Sciences

Professional athletes are threatening to strike because they claim that they are underpaid. The team owners hav...

Essentials Of Statistics

Identify and sketch the graph of each surface. 33. 4x2 + y2 4z2 = 4

Multivariable Calculus

Research results indicate that physically attractive people are also perceived as being more intelligent (Eagly...

Essentials of Statistics for The Behavioral Sciences (MindTap Course List)

Use a calculator to find the following. Round your answers to four decimal places. cot253.8

Trigonometry (MindTap Course List)

Intersection of SurfaceIdentify the curve of intersection of the surfaces (in cylindrical coordinates) z=sin an...

Multivariable Calculus

Find an equation of the tangent line to the curve at the given point. y = 4x 3x2, (2, 4)

Single Variable Calculus: Early Transcendentals, Volume I

Using a Power Series In Exercises 37-40, use the power series 11x=n=08xn,| x |1 to find a power series for the ...

Calculus (MindTap Course List)

Using Partial Fractions In Exercises 3-20, use partial fractions to find the indefinite integral. x3x+3x2+x2dx

Calculus of a Single Variable

Finding a Position Vector by Integration In Exercises 21-26, use the given acceleration vector and initial cond...

Calculus

In the following Exercises, find each indefinite integral, using appropriate substitutions. 400. dx25+16x2

Calculus Volume 2

If a mass weighing 10 pounds stretches a spring 2.5 feet, a mass weighing 32 pounds will stretch it __________ ...

A First Course in Differential Equations with Modeling Applications (MindTap Course List)

In the following exercises, assume that limx6f(x)=4,limx6g(x)=9,andlimx6h(x)=6 . Use these three facts and the ...

Calculus Volume 1

Direct Variation In Exercises 19-24, find a direct variation model that relates y and x. x=24,y=3

College Algebra

Determine that the key terms refer to in the example for Researcher A. Researcher A: 3; 4; 11; 15; 16; 17; 22; ...

Introductory Statistics

11. The following data are from a simple random sample. What is the point estimate of the population mean? Wha...

Modern Business Statistics with Microsoft Office Excel (with XLSTAT Education Edition Printed Access Card) (MindTap Course List)

bartleby
  • Contact Research (Essays)
  • High School Textbooks
  • Literature Guides
  • Essay Help
  • Mobile App
    • © 2021 bartleby. All Rights Reserved.