PLEASE READ THE INSTRUCTION BEFORE ANSWERING THIS QUESTION! Please complete the algorithm for computing PageRank in Matlab by filling in the MISSING LINES which are indicated by the COMMENTS. Please DO NOT answer with a different algorithm other than the one provided below. Thanks.

% This function implements the PageRank algorithm. dbstop if error; clear; clc; close all;

dDecayFactor = 0.85;

mAdjacencyMatrix = [ 0 1 0 0 0; % node 1 0 0 1 1 0; % node 2 0 0 0 1 0; % node 3 1 0 0 0 1; % node 4 0 0 1 0 0; % node 5 ]; nNumOfNodes = size(mAdjacencyMatrix,1);

% Node degree matrix vNodeDegree = sum(mAdjacencyMatrix,2); mNodeDegreeMatrix = diag(vNodeDegree); mNodeDegreeMatrixInv = pinv(mNodeDegreeMatrix);

% Compute the node transition probability matrix mNodeTransProbMatrixP = ; % Please complete this line

% Compute the PageRank values by using the matrix inverse mPRMatrix = ; % Please complete this line vPRVector1 = sum(mPRMatrix,2) / nNumOfNodes; disp("Method 1: Matrix Inversion"); disp("PageRank values"); display(vPRVector1);

% Compute the PageRank values by using the iterative method disp("Method 2: Power Iteration"); vPRVector2 = []; vTeleportationVector = ones(nNumOfNodes,1) / nNumOfNodes; vPRVector2_old = vTeleportationVector; nIdxOfIteration = 0; while true vPRVector2_new = ; % Please complete this line if norm(vPRVector2_new - vPRVector2_old) < 10^(-6) vPRVector2 = vPRVector2_new; disp("# of iterations"); disp(nIdxOfIteration); break; end %Please add one line here nIdxOfIteration = nIdxOfIteration + 1; end disp("PageRank values"); display(vPRVector2);

figure;