Answer:
b. Synchronous replication
Explanation:
Replication of data in storage partitions or in a number redundant array of independent disk drives helps to promote redundancy, as implied, and faulty tolerance to reduce loss of data.
There are two categories of replication and they are synchronous and asynchronous replication.
Synchronous replication requires low latency network site to mirror data, while asynchronous replication mirrors data in large metropolitan area in high latency networks.
Answer:
Let the function be Node* ins(Node *root,int k)
if root node is NULL then return new node with data equal to k.
If the k <root->data
root->left=ins(root->left,k);
else if k >root->data
root->right =ins(root->right,k);
At last return root.
Explanation:
Node is always inserted at the at the leaf node.We will search k in the tree if we hit a the leaf node the new node is inserted as the child of the leaf node.
Profitability Calculator: https://www.cryptocompare.com/mining/calculator/eth?HashingPower=200&HashingUnit=MH%2Fs&PowerConsumption=140&CostPerkWh=0.12&MiningPoolFee=1
Difficulty Level Chart: https://www.coinwarz.com/difficulty-charts/ethereum-difficulty-chart
D. Reply.
<u><em>Brainiest PLEASE!
</em></u>
