#includestudio.hvoid f(int *p, int *q){p = q;*p = 2;}int i = 0, j = 1;int main(){f(&i, &j);printf("%d %d n", i, j);getchar();return 0;}What will be the output?
import java.util.Scanner;What is the outputclass Fibonacci{public static void main(String args[ ]){System.out.println("Enter the number");Scanner sc = new Scanner(System.in);int w = sc.nextint();int a=0, b=1;int c;for(int i = o; i«=w; i++)c= a*b;System.out.println(c);a=b; b=c;}}}
Consider the given graph. What is the weight of the minimum spanning tree using Prims algorithm, starting from vertex a if the edge 10 is replaced by weight 20 ?