Answer:
The correct answer to the following question is option b.)sends messages involving products of companies previously sued under the CAN-SPAM Act.
Explanation:
This act is an act of Controlling the Assault of Non-Solicited Marketing And Other things.
It is the law that establish the rules for the commercial message and the commercial e-mails, gives recipients right to have the business stops emailing them, and they outline the penalties incurred for those person who has violated the law.
Answer:
A. using a hook in his opening
B. detailing the speech’s objectives
E. letting his audience know what to expect
Explanation:
Opening his speech using a quotation is a strategy of using a narrative hook, or simply hook, by Ian. Giving a grand and enticing opening is what makes an audience to pay attention and listen to what the speaker has to say in his speech. So, first strategy used by Ian is using a hook in his opening.
Another strategy used by Ian is giving objective details of his speech. By outlining what he will be covering in his speech, Ian is letting his audience know what to expect from the speaker and his speech, and also gave details of his speech.
So, option A, B, and E are correct.
Answer:
Einstein analytics plus user
Explanation:
Einstein data insights is a platform that can be used by a company to analyse Salesforce report. With a subscription to this platform, an administrator can grant limited access to users in the company and monitor the logs and reports.
To grant a user access to Einstein data insights, go to setup and find permission set on the quick find box, on the "permission set", click on "einstein analytics plus user", then click on "manage assignment | add assignment". Add the users you want and then click on "assign".
Answer:
Answer explained below
Explanation:
void bubbleSort(int X[], int Y[], int n)
{
int i, j;
for (i = 0; i < n-1; i++)
// Last i elements are already in place
for (j = 0; j < n-i-1; j++)
if (X[j] > X[j+1])
{
swap(X[j],X[j+1])
swap(Y[j],Y[j+1]);
}
if (X[j] == X[j+1]&&Y[j]<Y[j+1])
{
swap(X[j],X[j+1])
swap(Y[j],Y[j+1]);
}
}
Since the above algorithm contains 2 nested loops over n.
So, it is O(n^2)
