Answer:
in javascript:
function compute(a, b, c){
let array = [a, b, c];
array.forEach((e,k) => {
if(e >= a && e >= b && e >= c){
console.log("maximum: " + e);
}
if( e <= a && e <= b && e <= c){
console.log("minimum: " + e);
}
}
}
Explanation:
Doubly linked chain
When a linked chain contains nodes that reference both the next node and the previous node, it is called a doubly linked chain. This type of chain is often used in data structures because it provides a way to easily traverse the data in both directions. However, because each node must reference both the next node and the previous node, doubly linked chains require more memory than singly linked chains.
Learn more here:
brainly.com/question/13100699
#SPJ4
Answer:
Perform a full backup once per week and a differential backup the other days of the week.
