A band from the 1970s has reunited. They want to revive their careers, but they do not have the funding they once did. An intern
ational tour is not financially possible. The band needs to build renewed interest in their music and make a profit. Which of the following would be the best decision for this band?
A) Plan a small concert tour through the United States with limited performances in key cities.
B) Use a crowdfunding source to raise money for an international tour.
C) Plan a one-night reunion concert that will be broadcast live, online, and on cable, then sell recordings of the event.
D) Use social media to publicize a national tour and set up media interviews with key entertainment news publications.
A band from the 1970s has reunited. They want to revive their careers, but they do not have the funding they once did. An international tour is not financially possible. The band needs to build renewed interest in their music and make a profit.
Which of the following would be the best decision for this band?
\\
The correct answer to the following question will be "n logn".
Explanation:
Time Complexity should be the same as the whole last particular instance, just the log base keeps changing with three.
Throughout the circumstance of separating 2 arrays, we want one correlation. however, for splitting between 3-way arrays, will require 2 comparisons to sort.
However, after breaking the array into 3, we can lower the number of transfers by growing the comparison. So the time complexity would then persist the same, but the log should get base 3 as we've classified into different parts.
