DISCRETE MATH
8th Edition
ISBN: 9781266712326
Author: ROSEN
Publisher: MCG CUSTOM
expand_more
expand_more
format_list_bulleted
Videos
Textbook Question
Chapter 3.1, Problem 39E
- Adapt the bubble sort algorithm so that it stops when no interchanges are required. Express this more efficient version of the algorithm in pseudocode.
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
5) State any theorems that you use in determining your solution.
a) Suppose you are given a model with two explanatory variables such that:
Yi = a +ẞ1x1 + ẞ2x2i + Ui, i = 1, 2, ... n
Using partial differentiation derive expressions for the intercept and slope
coefficients for the model above.
[25 marks]
b)
A production function is specified as:
Yi = α + B₁x1i + ẞ2x2i + Ui,
i = 1, 2, ... n,
u₁~N(0,σ²)
where:
y = log(output), x₁ = log(labor input), x2 = log(capital input)
The results are as follows:
x₁ = 10, x2 = 5, ỹ = 12, S11 = 12, S12= 8, S22 = 12, S₁y = 10,
= 8, Syy = 10,
S2y
n = 23 (individual firms)
i) Compute values for the intercept, the slope coefficients and σ².
[20 marks]
ii)
Show that SE (B₁) = 0.102.
[15 marks]
iii)
Test the hypotheses: ẞ1
=
1 and B2 = 0, separately at the 5%
significance level. You may take without calculation that SE (a) = 0.78
and SE (B2) = 0.102
[20 marks]
iv)
Find a 95% confidence interval for the estimate ẞ2.
[20 marks]
Page < 2
of 2
- ZOOM +
The set of all 3 x 3 upper triangular matrices
6) Determine whether each of the following sets, together with the standard
operations, is a vector space. If it is, then simply write 'Vector space'. You do not
have to prove all ten vector space axioms. If it is not, then identify one of the ten
vector space axioms with its number in the attached sheet that fails and also show
that how it fails.
a) The set of all polynomials of degree four or less.
b) The set of all 2 x 2 singular matrices.
c) The set {(x, y) : x ≥ 0, y is a real number}.
d) C[0,1], the set of all continuous functions defined on the interval [0,1].
7) Given u = (-2,1,1) and v = (4,2,0) are two vectors in R³-space. Find u xv and
show that it is orthogonal to both u and v.
8) a) Find the equation of the least squares regression line for the data points
below.
(-2,0), (0,2), (2,2)
b) Graph the points and the line that you found from a) on the same Cartesian
coordinate plane.
1. A consumer group claims that the mean annual consumption of cheddar cheese by a person in
the United States is at most 10.3 pounds. A random sample of 100 people in the United States has
a mean annual cheddar cheese consumption of 9.9 pounds. Assume the population standard
deviation is 2.1 pounds. At a = 0.05, can you reject the claim? (Adapted from U.S. Department of
Agriculture)
State the hypotheses:
Calculate the test statistic:
Calculate the P-value:
Conclusion (reject or fail to reject Ho):
2. The CEO of a manufacturing facility claims that the mean workday of the company's assembly
line employees is less than 8.5 hours. A random sample of 25 of the company's assembly line
employees has a mean workday of 8.2 hours. Assume the population standard deviation is 0.5
hour and the population is normally distributed. At a = 0.01, test the CEO's claim.
State the hypotheses:
Calculate the test statistic:
Calculate the P-value:
Conclusion (reject or fail to reject Ho):
Statistics
Chapter 3 Solutions
DISCRETE MATH
Ch. 3.1 - List all the steps used by Algorithm 1 to find the...Ch. 3.1 - Determine which characteristics of an algorithm...Ch. 3.1 - Devise an algorithm that finds the sum of all the...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Describe an algorithm that takes as input a list...Ch. 3.1 - Apalindromeis a string that reads the same forward...Ch. 3.1 - Devise an algorithm to computexn, wherexis a real...
Ch. 3.1 - Describe an algorithm that interchanges the values...Ch. 3.1 - cribe an algorithm that uses only assignment...Ch. 3.1 - List all the steps used to search for 9 in the...Ch. 3.1 - List all the steps used to search for 7 in the...Ch. 3.1 - cribe an algorithm that inserts an integerxin the...Ch. 3.1 - Describe an algorithm for finding the smallest...Ch. 3.1 - Describe an algorithm that locates the first...Ch. 3.1 - Describe an algorithm that locates the last...Ch. 3.1 - Describe an algorithm that produces the maximum,...Ch. 3.1 - Describe an algorithm for finding both the largest...Ch. 3.1 - Describe an algorithm that puts the first three...Ch. 3.1 - Prob. 22ECh. 3.1 - Prob. 23ECh. 3.1 - Describe an algorithm that determines whether a...Ch. 3.1 - Describe an algorithm that will count the number...Ch. 3.1 - nge Algorithm 3 so that the binary search...Ch. 3.1 - Theternary search algorithmlocates an element in a...Ch. 3.1 - Specify the steps of an algorithm that locates an...Ch. 3.1 - Devise an algorithm that finds a mode in a list of...Ch. 3.1 - Devise an algorithm that finds all modes. (Recall...Ch. 3.1 - Two strings areanagramsif each can be formed from...Ch. 3.1 - ennreal numbersx1,x2,...,xn , find the two that...Ch. 3.1 - Devise an algorithm that finds the first term of a...Ch. 3.1 - Prob. 34ECh. 3.1 - Prob. 35ECh. 3.1 - Use the bubble sort to sort 6, 2, 3, 1, 5, 4,...Ch. 3.1 - Use the bubble sort to sort 3, 1, 5, 7, 4, showing...Ch. 3.1 - Use the bubble sort to sortd,f,k,m,a,b, showing...Ch. 3.1 - Adapt the bubble sort algorithm so that it stops...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Use the insertion sort to sort the list in...Ch. 3.1 - Sort these lists using the selection sort....Ch. 3.1 - Write the selection sort algorithm in pseudocode.Ch. 3.1 - Describe an algorithm based on the linear search...Ch. 3.1 - Describe an algorithm based on the binary search...Ch. 3.1 - How many comparisons does the insertion sort use...Ch. 3.1 - How many comparisons does the insertion sort use...Ch. 3.1 - Show all the steps used by the binary insertion...Ch. 3.1 - Compare the number of comparisons used by the...Ch. 3.1 - Prob. 51ECh. 3.1 - Devise a variation of the insertion sort that uses...Ch. 3.1 - Prob. 53ECh. 3.1 - List all the steps the naive string matcher uses...Ch. 3.1 - List all the steps the naive string matcher uses...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Use the cashier’s algorithm to make change using...Ch. 3.1 - Prob. 59ECh. 3.1 - Show that if there were a coin worth 12 cents, the...Ch. 3.1 - Prob. 61ECh. 3.1 - Prob. 62ECh. 3.1 - Devise a greedy algorithm that determines the...Ch. 3.1 - Suppose we have three menm1,m2, andm3and three...Ch. 3.1 - Write the deferred acceptance algorithm in...Ch. 3.1 - Prob. 66ECh. 3.1 - Prob. 67ECh. 3.1 - Prob. 68ECh. 3.1 - Prove that the Boyer-Moore majority vote algorithm...Ch. 3.1 - Show that the problem of determining whether a...Ch. 3.1 - Prob. 71ECh. 3.1 - Show that the problem of deciding whether a...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Prob. 11ECh. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - Exercises 1—14, to establish a big-Orelationship,...Ch. 3.2 - ermine whetherx3isO(g(x))for each of these...Ch. 3.2 - Explain what it means for a function to be 0(1)Ch. 3.2 - w that iff(x)isO(x)thenf(x)isO(x2).Ch. 3.2 - Suppose thatf(x),g(x), andh(x)are functions such...Ch. 3.2 - kbe a positive integer. Show...Ch. 3.2 - Prob. 19ECh. 3.2 - To simplify:(3a5)3 27a15 Given information:(3a5)3....Ch. 3.2 - ange the functionsn, 1000 logn,nlogn,2n!,2n,3n,...Ch. 3.2 - Arrange the...Ch. 3.2 - Suppose that you have two different algorithms for...Ch. 3.2 - Suppose that you have two different algorithms for...Ch. 3.2 - Give as good a big-Oestimate as possible for each...Ch. 3.2 - e a big-Oestimate for each of these functions. For...Ch. 3.2 - Give a big-Oestimate for each of these functions....Ch. 3.2 - each function in Exercise 1, determine whether...Ch. 3.2 - Prob. 29ECh. 3.2 - Show that each of these pairs of functions are of...Ch. 3.2 - Prob. 31ECh. 3.2 - w thatf(x)andg(x)are functions from the set of...Ch. 3.2 - Prob. 33ECh. 3.2 - Show that3x2+x+1is(3x2)by directly finding the...Ch. 3.2 - Prob. 35ECh. 3.2 - lain what it means for a function to be(1).Ch. 3.2 - Prob. 37ECh. 3.2 - Give a big-Oestimate of the product of the...Ch. 3.2 - Prob. 39ECh. 3.2 - Prob. 40ECh. 3.2 - Prob. 41ECh. 3.2 - pose thatf(x)isO(g(x)). Does it follow...Ch. 3.2 - Prob. 43ECh. 3.2 - pose thatf(x),g(x), andh(x)are functions such...Ch. 3.2 - Prob. 45ECh. 3.2 - Prob. 46ECh. 3.2 - Prob. 47ECh. 3.2 - ress the relationshipf(x)is(g(x))using a picture....Ch. 3.2 - Prob. 49ECh. 3.2 - w that iff(x)=anxn+an1xn1++a1x+a0,...Ch. 3.2 - Prob. 51ECh. 3.2 - Prob. 52ECh. 3.2 - Prob. 53ECh. 3.2 - w thatx5y3+x4y4+x3y5is(x3y3).Ch. 3.2 - w thatxyisO(xy).Ch. 3.2 - w thatxyis(xy).Ch. 3.2 - Prob. 57ECh. 3.2 - Prob. 58ECh. 3.2 - Prob. 59ECh. 3.2 - Prob. 60ECh. 3.2 - Prob. 61ECh. 3.2 - (Requires calculus) Prove or disprove that (2n)!...Ch. 3.2 - Prob. 63ECh. 3.2 - Prob. 64ECh. 3.2 - Prob. 65ECh. 3.2 - Prob. 66ECh. 3.2 - Prob. 67ECh. 3.2 - Prob. 68ECh. 3.2 - Prob. 69ECh. 3.2 - Prob. 70ECh. 3.2 - Prob. 71ECh. 3.2 - Prob. 72ECh. 3.2 - Show thatnlognisO(logn!).Ch. 3.2 - Prob. 74ECh. 3.2 - Prob. 75ECh. 3.2 - Prob. 76ECh. 3.2 - (Requires calculus) For each of these pairs of...Ch. 3.3 - Give a big-Oestimate for the number of operations...Ch. 3.3 - Give a big-Oestimate for the number additions used...Ch. 3.3 - Give a big-Oestimate for the number of operations,...Ch. 3.3 - Give a big-Oestimate for the number of operations,...Ch. 3.3 - Prob. 5ECh. 3.3 - Use pseudocode to describe the algorithm that puts...Ch. 3.3 - Suppose that an element is known to be among the...Ch. 3.3 - Prob. 8ECh. 3.3 - Give a big-Oestimate for the number of comparisons...Ch. 3.3 - Show that this algorithm determines the number of...Ch. 3.3 - pose we havensubsetsS1,S2, ...,Snof the set {1, 2,...Ch. 3.3 - Consider the following algorithm, which takes as...Ch. 3.3 - The conventional algorithm for evaluating a...Ch. 3.3 - re is a more efficient algorithm (in terms of the...Ch. 3.3 - t is the largestnfor which one can solve within...Ch. 3.3 - What is the largestnfor which one can solve within...Ch. 3.3 - What is the largestnfor which one can solve within...Ch. 3.3 - How much time does an algorithm take to solve a...Ch. 3.3 - Prob. 19ECh. 3.3 - What is the effect in the time required to solve a...Ch. 3.3 - Prob. 21ECh. 3.3 - Determine the least number of comparisons, or...Ch. 3.3 - Analyze the average-case performance of the linear...Ch. 3.3 - An algorithm is calledoptimalfor the solution of a...Ch. 3.3 - Describe the worst-case time complexity, measured...Ch. 3.3 - Prob. 26ECh. 3.3 - Prob. 27ECh. 3.3 - Prob. 28ECh. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Analyze the worst-case time complexity of the...Ch. 3.3 - Prob. 32ECh. 3.3 - Prob. 33ECh. 3.3 - Prob. 34ECh. 3.3 - Determine a big-O estimate for the worst-case...Ch. 3.3 - Determine the number of character comparisons used...Ch. 3.3 - Determine a big-Oestimate of the number of...Ch. 3.3 - Prob. 38ECh. 3.3 - Prob. 39ECh. 3.3 - Show that the greedy algorithm for making change...Ch. 3.3 - rcises 41 and 42 deal with the problem of...Ch. 3.3 - rcises 41 and 42 deal with the problem of...Ch. 3.3 - Prob. 43ECh. 3.3 - Prob. 44ECh. 3.3 - Prob. 45ECh. 3.3 - Prob. 46ECh. 3.3 - Prob. 47ECh. 3.3 - Prob. 48ECh. 3.3 - Prob. 49ECh. 3 - Define the termalgorithm. What are the different...Ch. 3 - Describe, using English, an algorithm for finding...Ch. 3 - Prob. 3RQCh. 3 - Prob. 4RQCh. 3 - Prob. 5RQCh. 3 - Define what the worst-case time complexity,...Ch. 3 - Prob. 7RQCh. 3 - Describe the bubble sort algorithm. Use the bubble...Ch. 3 - Describe the insertion sort algorithm. Use the...Ch. 3 - Explain the concept of a greedy algorithm. Provide...Ch. 3 - Prob. 11RQCh. 3 - Describe an algorithm for locating the last...Ch. 3 - Prob. 2SECh. 3 - Give an algorithm to determine whether a bit...Ch. 3 - Suppose that a list contains integers that are in...Ch. 3 - Prob. 5SECh. 3 - Prob. 6SECh. 3 - Prob. 7SECh. 3 - Prob. 8SECh. 3 - Prob. 9SECh. 3 - Prob. 10SECh. 3 - Show the steps used by the shaker sort to sort the...Ch. 3 - Express the shaker sort in pseudocode.Ch. 3 - Prob. 13SECh. 3 - Prob. 14SECh. 3 - Prob. 15SECh. 3 - w that8x3+12x+100logxisO(x3).Ch. 3 - Prob. 17SECh. 3 - Prob. 18SECh. 3 - Prob. 19SECh. 3 - w thatnnis notO(n!).Ch. 3 - Prob. 21SECh. 3 - Prob. 22SECh. 3 - Prob. 23SECh. 3 - Prob. 24SECh. 3 - Arrange the...Ch. 3 - Prob. 26SECh. 3 - Prob. 27SECh. 3 - Show that if the denominations of coins arec0,c1,...Ch. 3 - Prob. 29SECh. 3 - Prob. 30SECh. 3 - Prob. 31SECh. 3 - Show that the deferred acceptance algorithm given...Ch. 3 - Prob. 33SECh. 3 - Show that when woman do the proposing in the...Ch. 3 - Prob. 35SECh. 3 - Prob. 36SECh. 3 - Prob. 37SECh. 3 - Prob. 38SECh. 3 - Prob. 39SECh. 3 - Prob. 40SECh. 3 - Prob. 41SECh. 3 - Exercises 4246 we will study the problem of load...Ch. 3 - Prob. 43SECh. 3 - Prob. 44SECh. 3 - Prob. 45SECh. 3 - Prove that the algorithm from Exercise 44 is a...Ch. 3 - Prob. 1CPCh. 3 - Prob. 2CPCh. 3 - Prob. 3CPCh. 3 - Prob. 4CPCh. 3 - Prob. 5CPCh. 3 - Prob. 6CPCh. 3 - Prob. 7CPCh. 3 - Given an integern, use the cashier’s algorithm to...Ch. 3 - Prob. 9CPCh. 3 - Prob. 10CPCh. 3 - Prob. 11CPCh. 3 - Prob. 1CAECh. 3 - Prob. 2CAECh. 3 - Using a generator of random orderings of the...Ch. 3 - Prob. 4CAECh. 3 - Write a program that animates the progress of all...Ch. 3 - Examine the history of the wordalgorithmand...Ch. 3 - Prob. 2WPCh. 3 - Explain how sorting algorithms can be classified...Ch. 3 - Prob. 4WPCh. 3 - Prob. 5WPCh. 3 - Prob. 6WPCh. 3 - Describe the historic trends in how quickly...Ch. 3 - Develop a detailed list of algorithmic paradigms...Ch. 3 - Explain what the Turing Award is and describe the...Ch. 3 - Prob. 10WPCh. 3 - Prob. 11WPCh. 3 - Describe six different NP-complete problems.Ch. 3 - Prob. 13WP
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, subject and related others by exploring similar questions and additional content below.Similar questions
- Page < 1 of 2 - ZOOM + 1) a) Find a matrix P such that PT AP orthogonally diagonalizes the following matrix A. = [{² 1] A = b) Verify that PT AP gives the correct diagonal form. 2 01 -2 3 2) Given the following matrices A = -1 0 1] an and B = 0 1 -3 2 find the following matrices: a) (AB) b) (BA)T 3) Find the inverse of the following matrix A using Gauss-Jordan elimination or adjoint of the matrix and check the correctness of your answer (Hint: AA¯¹ = I). [1 1 1 A = 3 5 4 L3 6 5 4) Solve the following system of linear equations using any one of Cramer's Rule, Gaussian Elimination, Gauss-Jordan Elimination or Inverse Matrix methods and check the correctness of your answer. 4x-y-z=1 2x + 2y + 3z = 10 5x-2y-2z = -1 5) a) Describe the zero vector and the additive inverse of a vector in the vector space, M3,3. b) Determine if the following set S is a subspace of M3,3 with the standard operations. Show all appropriate supporting work.arrow_forwardFind the Laplace Transform of the function to express it in frequency domain form.arrow_forwardPlease draw a graph that represents the system of equations f(x) = x2 + 2x + 2 and g(x) = –x2 + 2x + 4?arrow_forward
- Given the following system of equations and its graph below, what can be determined about the slopes and y-intercepts of the system of equations? 7 y 6 5 4 3 2 -6-5-4-3-2-1 1+ -2 1 2 3 4 5 6 x + 2y = 8 2x + 4y = 12 The slopes are different, and the y-intercepts are different. The slopes are different, and the y-intercepts are the same. The slopes are the same, and the y-intercepts are different. O The slopes are the same, and the y-intercepts are the same.arrow_forwardChoose the function to match the graph. -2- 0 -7 -8 -9 --10- |--11- -12- f(x) = log x + 5 f(x) = log x - 5 f(x) = log (x+5) f(x) = log (x-5) 9 10 11 12 13 14arrow_forwardQ2 H let x(+) = &cos (Ait+U) and. 4(+) = ß cos(12t +V), where d. B. 1. In Constants and U,V indep.rus have uniform dist. (-π,π) Show that: ①Rxy (+,4+1)=0 @ Rxy (++) = cos [ when U=V Q3 let x(t) is stochastic process with Wss -121 e, and Rx ltst+1) = ( 2, show that E(X) = E(XS-X₁)² = 2(-1). Qu let x(t) = U Cost + (V+1) Sint, tεIR. where UV indep.rus, and let E (U)-E(V)=0 and E(U) = E(V) = 1, show that Cov (Xt, Xs) = K (t,s) = cos(s-t) X(+) is not WSS.arrow_forward
- Which of the following represents the graph of f(x)=3x-2? 7 6 5 4 ++ + + -7-6-5-4-3-2-1 1 2 3 4 5 6 7 -2 3 -5 6 -7 96 7 5 4 O++ -7-6-5-4-3-2-1 -2 -3 -4 -5 -7 765 432 -7-6-5-4-3-2-1 -2 ++ -3 -4 -5 -6 2 3 4 5 6 7 7 6 2 345 67 -7-6-5-4-3-2-1 2 3 4 5 67 4 -5arrow_forward21. find the mean. and variance of the following: Ⓒ x(t) = Ut +V, and V indepriv. s.t U.VN NL0, 63). X(t) = t² + Ut +V, U and V incepires have N (0,8) Ut ①xt = e UNN (0162) ~ X+ = UCOSTE, UNNL0, 62) SU, Oct ⑤Xt= 7 where U. Vindp.rus +> ½ have NL, 62). ⑥Xn = ΣY, 41, 42, 43, ... Yn vandom sample K=1 Text with mean zen and variance 6arrow_forwardA psychology researcher conducted a Chi-Square Test of Independence to examine whether there is a relationship between college students’ year in school (Freshman, Sophomore, Junior, Senior) and their preferred coping strategy for academic stress (Problem-Focused, Emotion-Focused, Avoidance). The test yielded the following result: image.png Interpret the results of this analysis. In your response, clearly explain: Whether the result is statistically significant and why. What this means about the relationship between year in school and coping strategy. What the researcher should conclude based on these findings.arrow_forward
- A 20 foot ladder rests on level ground; its head (top) is against a vertical wall. The bottom of the ladder begins by being 12 feet from the wall but begins moving away at the rate of 0.1 feet per second. At what rate is the top of the ladder slipping down the wall? You may use a calculator.arrow_forwardA school counselor is conducting a research study to examine whether there is a relationship between the number of times teenagers report vaping per week and their academic performance, measured by GPA. The counselor collects data from a sample of high school students. Write the null and alternative hypotheses for this study. Clearly state your hypotheses in terms of the correlation between vaping frequency and academic performance. EditViewInsertFormatToolsTable 12pt Paragrapharrow_forwardPlease help solve the following whilst showing all working out. Is part of exam revision questions but no solution is givenarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
Linear Algebra: A Modern IntroductionAlgebraISBN:9781285463247Author:David PoolePublisher:Cengage Learning
Elementary Linear Algebra (MindTap Course List)AlgebraISBN:9781305658004Author:Ron LarsonPublisher:Cengage Learning
Elements Of Modern AlgebraAlgebraISBN:9781285463230Author:Gilbert, Linda, JimmiePublisher:Cengage Learning,
Linear Algebra: A Modern Introduction
Algebra
ISBN:9781285463247
Author:David Poole
Publisher:Cengage Learning
Elementary Linear Algebra (MindTap Course List)
Algebra
ISBN:9781305658004
Author:Ron Larson
Publisher:Cengage Learning
Elements Of Modern Algebra
Algebra
ISBN:9781285463230
Author:Gilbert, Linda, Jimmie
Publisher:Cengage Learning,
Graph Theory: Euler Paths and Euler Circuits; Author: Mathispower4u;https://www.youtube.com/watch?v=5M-m62qTR-s;License: Standard YouTube License, CC-BY
WALK,TRIAL,CIRCUIT,PATH,CYCLE IN GRAPH THEORY; Author: DIVVELA SRINIVASA RAO;https://www.youtube.com/watch?v=iYVltZtnAik;License: Standard YouTube License, CC-BY