4. Only (ii)
<u>Explanation:</u>
The declaration of the array can be of two types:
1. int a[100];
2. int[] a = new int[100];
The general thing about an array is that whenever we want to undergo traversal in an array, we always have to start from the 0th position as the size of the array may be a whole number (let us say 10). So, to undergo traversal in an array, we start from 0 to n-1 (in this case 9) such that it covers the size of the array.
The size of an array can be finite or infinite. The general rule is it starts from 0 to n-1 where n is the size of the array. In the above example, the range of the index of the array will be 0 through 100 and not 1 through 100.
You literally don’t do anything you’re just like dead of sun
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.
By learning how to follow, one can be a good leader because: Looking up to a leader and following them help to:
- Keep one's ego in check and one can be able to be a good ego manager.
- They create strong credibility.
- They help use to focus our efforts for maximum impact.
<h3>How does being a good follower make you a good leader?</h3>
As a good follower, a person can be able to have the boldness and confidence to be able to respectfully talk about a lot of things with their leader if you see that you're not going in the right way.
Note that one can trust your leader and this will boast up the spirit of your input and engagement in all.
Hence, By learning how to follow, one can be a good leader because: Looking up to a leader and following them help to:
- Keep one's ego in check and one can be able to be a good ego manager.
- They create strong credibility.
- They help use to focus our efforts for maximum impact.
Learn more about good leader from
brainly.com/question/12522775
#SPJ1
Answer
System restore
Explanation
System restore is a recovery feature that helps restore your system to the previous condition or point. Most computers have system restore disks which are an advantage to the users especially when the computer clashes.These disks are very effective when it comes to restoring the system to its initial state.
