Answer:
B. Use a new support manager permission sets
Explanation:
According to the requirements, field level security is required so, 1st options is not suitable because it may reduce the maintenance cost but increase the risk of security.
By creating a separate page for each of the two, it will leads to increase in the maintenance cost of the system. So <u>Option C</u> is also not suitable.
Option B is more Suitable as compared to others, that <em>Create a new support manager permission set</em>, with the help of this, both of Support rep and Support manager can visualize their required information with the help of support manager permission. This solution will not compromise the security and not increase the maintenance cost.
Answer:Protects the local network from outside access
Explanation:Proxy is a type of serves as the mediator in computer network for connecting the network with the user system. These servers are responsible for maintaining the security against any unauthorized access in the system or internet,privacy and other functions.. It helps in protecting the whole network connection by taking the control at the servers .
The opposite of expanding a folder is Collapsing a folder. Hope I helped :)
Answer: Walkway Over the Hudson, a bridge that crosses the Hudson River in Poughkeepsie, is 2.063 kilometers long. Anping Bridge, which was built in China 850 years ago, is 2.07 kilometers long.
HOPE IT HELPED:)
Answer:
#include <iostream>
using namespace std;
void swap(int *a,int *b){ //function to interchange values of 2 variables
int temp=*a;
*a=*b;
*b=temp;
}
void sort(int queue[],int n)
{
int i,j;
for(i=0;i<n;i++) //to implement bubble sort
{
for(j=0;j<n-i-1;j++)
{
if(queue[j]>queue[j+1])
swap(queue[j],queue[j+1]); //to swap values of these 2 variables
}
}
}
int main()
{
int queue[]={6,4,2,9,5,1};
int n=sizeof(queue)/4; //to find length of array
sort(queue,n);
for(int i=0;i<n;i++)
cout<<queue[i]<<" ";
return 0;
}
OUTPUT :
1 2 4 5 6 9
Explanation:
In the above code, Queue is implemented using an array and then passed to a function sort, so that the queue can be sorted in ascending order. In the sort function, in each pass 2 adjacent values are compared and if lower index value is greater than the higher one they are swapped using a swap function that is created to interchange the values of 2 variables.
