For Part B, please use do loops to find the neighbor list.

Need help!! Please provide a step-by-step solution through the use of mathematica code along with a detailed explanation!!!! This is very URGENT!!! PLEASE reply as soon as possible!! Thank you!!

Number of data points) numpts 5; Test data set) ptso, e), (l, e, (o, 1), (1, 1), (o.3, .4 dmesh DelaunayMesh [pts] Extract the triangle list from the Delaunay triangulation ) tris Meshcells [dmesh, 2] numtris -Length[tris]; * This demonstrates how to access the pts from the tris list ) Print[" Number of triangles numtris - ", numtris]; Do Print[ Tri ", i, v1-", pts [[tris[[i, 1, 1]111, " V2-", pts [[tris[ [i, 1, 2]]11, 3ltristti, 1, 3 fi, 1, numtris) 1: Number of triangles numtris-4 Tri 1 v1-(0, 1 v2 [0, e v3-(0.3, 0.4 Tri 2 v1 0.3, 0.4) v2-11, 0 v3(1, 1) Tri 4 v1-0.3, 0.4) v2-(1, 1) v3 -(0, 1) B. Create a neighbor list for a given triangulation as discussed in class. Data structure to hold neighbor data) nghbrs Table[ (e, o, e), (i, 1, numtris]; Your code here ) Number of data points) numpts 5; Test data set) ptso, e), (l, e, (o, 1), (1, 1), (o.3, .4 dmesh DelaunayMesh [pts] Extract the triangle list from the Delaunay triangulation ) tris Meshcells [dmesh, 2] numtris -Length[tris]; * This demonstrates how to access the pts from the tris list ) Print[" Number of triangles numtris - ", numtris]; Do Print[ Tri ", i, v1-", pts [[tris[[i, 1, 1]111, " V2-", pts [[tris[ [i, 1, 2]]11, 3ltristti, 1, 3 fi, 1, numtris) 1: Number of triangles numtris-4 Tri 1 v1-(0, 1 v2 [0, e v3-(0.3, 0.4 Tri 2 v1 0.3, 0.4) v2-11, 0 v3(1, 1) Tri 4 v1-0.3, 0.4) v2-(1, 1) v3 -(0, 1) B. Create a neighbor list for a given triangulation as discussed in class. Data structure to hold neighbor data) nghbrs Table[ (e, o, e), (i, 1, numtris]; Your code here )