B.) The addition of slide transitions
Answer:
Conditional formatting.
Explanation:
Conditional Formatting is the method that main objective to enabling the users for setting the formatting to the cell or the cell range as well as it adjust the layout based that are based on the cell value or the formula value.
- The Conditional formatting making the cell value as bold as in the given question we see that the cell value is bold when the given condition is true.
- The objective of pivot table is to summarizing the data it do not provide the formatting that's why this option is incorrect .
- The objective of what if analysis is altering the absolute value of worksheet also it see how some modifications will influence the result of the worksheet formulae in the spreadsheet it do not provide the formatting that's why this option is incorrect .
- Data scenario formatting do not provide the formatting that's why this option is incorrect .
Answer:
Two profiles, one record type, two page layouts.
Explanation:
Record types and functions allow you to present forward different business processes, pick-list values, as well as page layouts to diverse range of users based on their profiles.
Going by the question, we can conclude that the minimum necessary configuration in order to meet the requirement in the question above are:Two profiles, one record type, two page layouts.
The recursive function would work like this: the n-th odd number is 2n-1. With each iteration, we return the sum of 2n-1 and the sum of the first n-1 odd numbers. The break case is when we have the sum of the first odd number, which is 1, and we return 1.
int recursiveOddSum(int n) {
if(2n-1==1) return 1;
return (2n-1) + recursiveOddSum(n-1);
}
To prove the correctness of this algorithm by induction, we start from the base case as usual:
by definition of the break case, and 1 is indeed the sum of the first odd number (it is a degenerate sum of only one term).
Now we can assume that 
returns indeed the sum of the first n-1 odd numbers, and we have to proof that 
returns the sum of the first n odd numbers. By the recursive logic, we have
and by induction, is the sum of the first n-1 odd numbers, and 2n-1 is the n-th odd number. So, is the sum of the first n odd numbers, as required:
Answer:
// here is code in Java.
// package
import java.util.*;
// class definition
class Main
{
// method that return sum of two sale value
public static int Add(int euroSales,int asiaSales)
{
// return the sum
return euroSales+asiaSales;
}
//main method of the class
public static void main (String[] args) throws java.lang.Exception
{
try{
// variables
int euroSales=100;
int asiaSales=150;
int eurasiaSales;
// call the function
eurasiaSales=Add(euroSales,asiaSales);
// print the sum
System.out.println("total sale is:"+eurasiaSales);
}catch(Exception ex){
return;}
}
}
Explanation:
Declare and initialize two variables "euroSales=100" and "asiaSales=150". Declare another variable eurasiaSales. Call the method Add() with euroSales and asiaSales as parameter. This method will add both the value and return the sum.This sum will be assigned to variable eurasiaSales.Then print the sum.
Output:
total sale is:250
