Answer:
Question is incomplete.
Assuming the below info to complete the question
You have a collection of n lockboxes and m gold keys. Each key unlocks at most one box. Without a matching key, the only way to open a box is to smash it with a hammer. Your baby brother has locked all your keys inside the boxes! Luckily, you know which keys (if any) are inside each box.
Detailed answer is written in explanation field.
Explanation:
We have to find the reachability using the directed graph G = (V, E)
In this V are boxes are considered to be non empty and it may contain key.
Edges E will have keys .
G will have directed edge b1b2 if in-case box b1 will have key to box b2 and box b1 contains one key in it.
Suppose if a key opens empty box or doesn’t contain useful key means can’t open anything , then it doesn’t belongs to any edge.
Now, If baby brother has chosen box B, then we have to estimate for other boxes reachability from B in Graph G.
If and only if all other boxes have directed path from box B then just by smashing box B we can get the key to box b1 till last box and we can unlock those.
After first search from B we can start marking all other vertex of graph G.
So algorithm will be O ( V +E ) = O (n+m) time.
Answer:
"a callout is a type of text box that also includes a line for pointing to any location on the document. A callout appears under the SHAPES menu of the word processing program. The answer that completes this statement is the word "shapes". Hope this answers your question."
Explanation:
This question belongs to scratch programming. This programming language has various instructions to carry out various tasks. There are different types of repeat statement available. This statement or instruction allows the user / programmer to repeat certain line of statements to a number of times. Here, according to the question, we need to use “Repeat after me”
If you take a music note, the tempo, timing and pitch needs to be mentioned clearly and “:” represents that a particular note to be repeated only once.
Answer:
A and B have different output:
A output will be 1
B output will be 123
Explanation:
A
X = 0
do x < 3
x = x+1
print x
while
B
X = 0
do x = x+ 1
print x
while x < 3
For statement A the condition statement which suppose to be after "while" is not set therefore the value of x will be printed.
For statement B the condition statement is set "x < 3" in front of "while" thereby result in iteration until the condition is false.
Statement A output will be 1
Statement B output will be 123
